default search action
Discrete Mathematics, Volume 245
Volume 245, Number 1-3, February 2002
- Veerle Fack, Stijn Lievens, Joris Van der Jeugt:
On the diameter of the rotation graph of binary coupling trees. 1-18 - Lutz Volkmann:
Cycles in multipartite tournaments: results and problems. 19-53 - Méziane Aïder, Mustapha Aouchiche:
Distance monotonicity and a new characterization of hypercubes. 55-62 - Joel Berman, Gabriela Hauser Bordalo:
Irreducible elements and uniquely generated algebras. 63-79 - Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Daniel Kobler:
On the recognition of de Bruijn graphs and their induced subgraphs. 81-92 - Pierre Hansen, Brigitte Jaumard, Bruno Simeone:
Polynomial algorithms for nested univariate clustering. 93-105 - Clemens Heuberger:
On hamiltonian Toeplitz graphs. 107-125 - Yoshiyasu Ishigami, Hong Wang:
An extension of a theorem on cycles containing specified independent edges. 127-137 - Francisco Larrión, Victor Neumann-Lara:
On clique divergent graphs with linear growth. 139-153 - Josef Leydold:
The geometry of regular trees with the Faber?Krahn property. 155-172 - Guojun Li, Chuanping Chen, Gang Yu:
Orthogonal factorizations of graphs. 173-194 - Rao Li, Richard H. Schelp:
Hamiltonicity of {K1, 4, K1, 4+e}-free graphs. 195-202 - Aleksander Malnic, Dragan Marusic:
Constructing 1/2-arc-transitive graphs of valency 4 and vertex stabilizer Z2×Z2. 203-216 - Sergei Ovchinnikov:
Well-graded spaces of valued sets. 217-233 - Zhishi Pan, Xuding Zhu:
The circular chromatic number of series-parallel graphs of large odd girth. 235-246 - Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy:
Non-chordal graphs having integral-root chromatic polynomials II. 247-253 - Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary MacGillivray:
Star forests, dominating sets and Ramsey-type problems. 255-262 - Anka Golemac, Tanja Vucicic:
New (100, 45, 20) symmetric designs and Bush-type Hadamard matrices of order 100. 263-272 - Masaaki Harada:
Self-dual Z4-codes and Hadamard matrices. 273-278 - Dieter Rautenbach:
On Kelly's lemma for infinite sets of integers. 279-282 - Matthew E. Riddle:
The minimum forcing number for the torus and hypercube. 283-292 - V. Yegnanarayanan:
On a question concerning prime distance graphs. 293-298
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.