Discrete Mathematics, Volume 85
Volume 85, Number 1, November 1990
David W. Barnette: Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane. 1-16- Klaus Bongartz, Detlef Mertens: On the enumeration of Homeochromatic classes of k-chromatic tilings. 17-42
- Mao-cheng Cai: The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices. 43-52
- Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Subgraphs of minimal degree k. 53-58
- George R. T. Hendry: Extending cycles in graphs. 59-72
- Alexander V. Karzanov: Packings of cuts realizing distances between certain vertices in a planar graph. 73-87
- Maolin Zheng, Xiaoyun Lu: On the maximum induced forests of a connected cubic graph without triangles. 89-96
- Norbert Polat: On the existence of minimal end-separators. 97-98
- Hortensia Galeana-Sánchez: On the existence of (k, l)-kernels in digraphs. 99-102
- András Gyárfás: A simple lower bound on edge coverings by cliques. 103-104
- Mulan Liu: Homomorphisms and automorphisms of 2-D de Bruijn-Good graphs. 105-109
Volume 85, Number 2, November 1990
- Dieter Jungnickel: On the existence of small quasimultiples of affine and projective planes of arbitrary order. 177-189
- Jiang Zeng: Un modèle symétrique pour l'identité de Al-Salam-Fields. 207-213
- Tsuyoshi Nishimura: Regular factors of line graphs. 215-219
- R. Bruce Richter: Nonplanar graphs and well-covered cycles. 221-222
Volume 85, Number 3, December 1990
- Z. Hasan: Behavior of Steiner systems of M24. 257-279
- Christos Koukouvinos, Stratis Kounias: Construction of some Hadamard matrices with maximum excess. 295-300
- Yongjin Zhu, Chuanping Chen: An extreme problem concerning k-arc-cyclic property for a class of tournaments. 301-311
- Katherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu: A simple existence criterion for (g<f)- factors. 313-317
- John Isbell: Sequencing certain dihedral groups. 323-328
- Mark Ramras: A new method of generating Hamiltonian cycles on the n-cube. 329-331
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team