Discrete Mathematics, Volume 272

Volume 272, Number 1, October 2003

• Frank Harary:
  Preface. 1-2
  Electronic Edition (link) BibTeX
• Guest Editors. 3- BibTeX
• Nawarat Ananchuen, Michael D. Plummer:
  Some results related to the toughness of 3-domination critical graphs. 5-15
  Electronic Edition (link) BibTeX
• Lowell W. Beineke, Raymond E. Pippert:
  Multidimensional bipartite trees. 17-26
  Electronic Edition (link) BibTeX
• Jens-P. Bode, Heiko Harborth:
  Independence for knights on hexagon and triangle boards. 27-35
  Electronic Edition (link) BibTeX
• Gary Chartrand, Ladislav Nebesky, Ping Zhang:
  Greedy F-colorings of graphs. 37-46
  Electronic Edition (link) BibTeX
• Ronald D. Dutton, Robert C. Brigham, Chao Gui:
  Edge-recognizable domination numbers. 47-51
  Electronic Edition (link) BibTeX
• Paul Erdös, Stephen T. Hedetniemi, Renu Laskar, Geert C. E. Prins:
  On the equality of the partial Grundy and upper ochromatic numbers of graphs. 53-64
  Electronic Edition (link) BibTeX
• Teresa W. Haynes, Michael A. Henning:
  Changing and unchanging domination: a classification. 65-79
  Electronic Edition (link) BibTeX
• Robert E. Jamison, Fred R. McMorris, Henry Martyn Mulder:
  Graphs with only caterpillars as spanning trees. 81-95
  Electronic Edition (link) BibTeX
• Khee Meng Koh, Bock Boom Lim, Peter J. Slater:
  H-domination in graphs. 97-105
  Electronic Edition (link) BibTeX
• Brendan D. McKay, Edgar M. Palmer, Ronald C. Read, Robert W. Robinson:
  The asymptotic number of claw-free cubic graphs. 107-118
  Electronic Edition (link) BibTeX
• Hanumappa B. Walikar, Fred Buckley, M. K. Itagi:
  Radius-edge-invariant and diameter-edge-invariant graphs. 119-126
  Electronic Edition (link) BibTeX

Volume 272, Number 2-3, November 2003

• Charles Curtis Lindner, Christopher A. Rodger:
  A connection between varieties of quasigroups and graph decompositions. 127-137
  Electronic Edition (link) BibTeX
• John G. Gimbel, Chris Hartman:
  Subcolorings and the subchromatic number of a graph. 139-154
  Electronic Edition (link) BibTeX
• Yanxun Chang, Giovanni Lo Faro:
  The existence of directed BIBDs. 155-169
  Electronic Edition (link) BibTeX
• Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang:
  Stratification and domination in graphs. 171-185
  Electronic Edition (link) BibTeX
• Ervin Györi, Vladimir Nikiforov, Richard H. Schelp:
  Nearly bipartite graphs. 187-196
  Electronic Edition (link) BibTeX
• Gejza Jenca:
  Finite homogeneous and lattice ordered effect algebras. 197-214
  Electronic Edition (link) BibTeX
• S. Ole Warnaar:
  The generalized Borwein conjecture. II. Refined q-trinomial coefficients. 215-258
  Electronic Edition (link) BibTeX
• Amitava Bhattacharya:
  On a conjecture of Manickam and Singhi. 259-261
  Electronic Edition (link) BibTeX
• Bostjan Bresar, Blaz Zmazek:
  On the independence graph of a graph. 263-268
  Electronic Edition (link) BibTeX
• Keith Edwards:
  Edge decomposition of complete tripartite graphs. 269-275
  Electronic Edition (link) BibTeX
• Gennian Ge, J. Wang, Rolf S. Wei:
  MGDD with block size 4 and its application to sampling designs. 277-283
  Electronic Edition (link) BibTeX
• Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray:
  Coloring the hypergraph of maximal cliques of a graph with no long path. 285-290
  Electronic Edition (link) BibTeX
• S. K. Gupta, Pankaj Mangal, Vineet Paliwal:
  Some work towards the proof of the reconstruction conjecture. 291-296
  Electronic Edition (link) BibTeX
• Robert E. Jamison, Peter D. Johnson Jr.:
  The structure of (t, r)-regular graphs of large order. 297-300
  Electronic Edition (link) BibTeX