Discrete Mathematics, Volume 199

Volume 199, Numbers 1-3, March 1999

• Ruth A. Britto-Pacumio:
  Limits of iteratd H-line graphs. 1-10
  Electronic Edition (link) BibTeX
• Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley:
  Characterizations of bipartite Steinhaus graphs. 11-25
  Electronic Edition (link) BibTeX
• Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
  Balanced cycles and holes in bipartite graphs. 27-33
  Electronic Edition (link) BibTeX
• Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae:
  Minus domination in graphs. 35-47
  Electronic Edition (link) BibTeX
• Harald Fripertinger:
  Enumeration of mosaics. 49-60
  Electronic Edition (link) BibTeX
• Wayne Goddard, Michael A. Henning:
  Real and integer domination in graphs. 61-75
  Electronic Edition (link) BibTeX
• David J. Grabiner:
  Posets in which every interval is a product of chains, and natural local actions of the symmetric group. 77-84
  Electronic Edition (link) BibTeX
• Michael D. Hirschhorn, James A. Sellers:
  On representations of a number as a sum of three squares. 85-101
  Electronic Edition (link) BibTeX
• Jacques Mazoyer, Ivan Rapaport:
  Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results. 103-122
  Electronic Edition (link) BibTeX
• Colin McDiarmid, Bruce A. Reed:
  Colouring proximity graphs in the plane. 123-137
  Electronic Edition (link) BibTeX
• Michel Minoux:
  A generalization of the all minors tree theorem to semirings. 139-150
  Electronic Edition (link) BibTeX
• J. Schmid:
  On maximal sublattices of finite lattices. 151-159
  Electronic Edition (link) BibTeX
• Andreas E. Schroth:
  How to draw a hexagon. 161-171
  Electronic Edition (link) BibTeX
• Piotr Wójcik:
  Union-closed families of sets. 173-182
  Electronic Edition (link) BibTeX
• Wenan Zang:
  Acyclic diagraphs with the Gallai-Milgram-Linial property for clique-covers. 183-192
  Electronic Edition (link) BibTeX
• Rita Csákány, János Komlós:
  The smallest Ramsey numbers. 193-199
  Electronic Edition (link) BibTeX
• Bostjan Bresar:
  On clique-gated graphs. 201-205
  Electronic Edition (link) BibTeX
• Mike Daven, C. A. Rodger:
  (k, g)-cages are 3-connected. 207-215
  Electronic Edition (link) BibTeX
• Andrej Dujella:
  A bijective proof of Riordan's theorem on powers of Fibonacci numbers. 217-220
  Electronic Edition (link) BibTeX
• Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning:
  On perfect neighborhood sets in graphs. 221-225
  Electronic Edition (link) BibTeX
• Gary Haggard, Thomas R. Mathies:
  The computation of chromatic polynomials. 227-231
  Electronic Edition (link) BibTeX
• Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani, Manouchehr Zaker:
  A characterization of uniquely vertex colorable graphs using minimal defining sets. 233-236
  Electronic Edition (link) BibTeX
• Ren Han:
  Another cycle structure theorem for hamiltonian graphs. 237-243
  Electronic Edition (link) BibTeX
• Andreas Huck:
  Independent branchings in acyclic diagraphs. 245-249
  Electronic Edition (link) BibTeX
• Alexander K. Kelmans, Xuerong Yong:
  On the distribution of eigenvalues of graphs. 251-258
  Electronic Edition (link) BibTeX
• Péter Komjáth:
  Some remarks on universal graphs. 259-265
  Electronic Edition (link) BibTeX
• Miroslav Treml:
  Some partitions of positive integers. 267-271
  Electronic Edition (link) BibTeX
• Kazuhiko Ushio:
  Cycle-factorization of symmetric complete multipartite digraphs. 273-278
  Electronic Edition (link) BibTeX
• Baogen Xu, Zhongfu Zhang:
  On mixed Ramsey numbers. 285-289
  Electronic Edition (link) BibTeX
• Sanming Zhou:
  A sequential coloring algorithm for finite sets. 291-297
  Electronic Edition (link) BibTeX