Volume 24, Number 1, 2004

• 
  Gary Chartrand, Ladislav Nebesky, Ping Zhang: Radio k-colorings of paths. 5-21
• 
  Le Xuan Hung, Ngo Dac Tan: Hamilton cycles in split graphs with large minimum degree. 23-40
• 
  B. Basavanagoud, V. R. Kulli: Characterizations of planar plick graphs. 41-45
• 
  Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson: Forbidden triples implying Hamiltonicity: for all graphs. 47-54
• 
  Dalibor Froncek, Zdenek Ryjácek, Zdzislaw Skupien: On traceability and 2-factors in claw-free graphs. 55-71
• 
  Hortensia Galeana-Sánchez, Victor Neumann-Lara: On the heterochromatic number of circulant digraphs. 73-79
• 
  Chandrashekar Adiga, H. N. Ramaswamy, D. D. Somashekara: A note on strongly multiplicative graphs. 81-83
• 
  Stanislav Jendrol, Heinz-Jürgen Voss: Light classes of generalized stars in polyhedral maps on surfaces. 85-107
• 
  Geoffrey Exoo: Some applications of pq-groups in graph theory. 109-114
• 
  Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia: A note on minimally 3-connected graphs. 115-123
• 
  Ping Wang, Jianliang Wu: A note on total colorings of planar graphs without 4-cycles. 125-135
• 
  Maw-Shang Chang, Ruo-Wei Hung: A simple linear algorithm for the connected domination problem in circular-arc graphs. 137-145
• 
  Ernest J. Cockayne, Art Stephen Finbow: Generalised irredundance in graphs: Nordhaus-Gaddum bounds. 147-160

Volume 24, Number 2, 2004

• 
  Magdalena Lemanska: Lower bound on the domination number of a tree. 165-169
• 
  Hortensia Galeana-Sánchez: Some sufficient conditions on odd directed cycles of bounded length for the existence of a kernel. 171-182
• 
  Massimiliano Caramia, Jirí Fiala: New lower bounds on the weighted chromatic number of a graph. 183-195
• 
  Aneta Dudek, Adam Pawel Wojda: P_m-saturated bipartite graphs with minimum size. 197-211
• 
  Bo Zhou: Bounds for index of a modified graph. 213-221
• 
  Gek Ling Chia, C. S. Gan: Minimal regular graphs with given girths and crossing numbers. 223-237
• 
  Wayne Goddard, Teresa W. Haynes, Debra J. Knisley: Hereditary domination and independence parameters . 239-248
• 
  Ken-ichi Kawarabayashi: Vertex-disjoint copies of K₄^-. 249-262
• 
  Odile Favaron, Gerd Fricke, Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Petter Kristiansen, R. Duane Skaggs: Offensive alliances in graphs. 263-175
• 
  Hortensia Galeana-Sánchez: Cycle-pancyclism in bipartite tournaments I. 277-290
• 
  Dieter Rautenbach: Graphs with small additive stretch number. 291-301
• 
  Alewyn P. Burger, Christina M. Mynhardt, William D. Weakley: On the domination number of prisms of graphs. 303-318
• 
  Alastair Farrugia, R. Bruce Richter: Unique factorisation of additive induced-hereditary properties. 319-343
• 
  Dalibor Froncek: Cyclic decompositions of complete graphs into spanning trees. 345-353

Volume 24, Number 3, 2004

• 
  Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Florian Pfender: Linear forests and ordered cycles. 359-372
• 
  William Klostermeyer, Gary MacGillivray: Analogues of cliques for oriented coloring. 373-387
• 
  Bert Hartnell, Douglas F. Rall: On dominating the Cartesian product of a graph and K₂. 389-402
• 
  Tomás Madaras: On the structure of plane graphs of minimum face size 5. 403-411
• 
  Endre Boros, Robert E. Jamison, Renu C. Laskar, Henry Martyn Mulder: On 3-simplicial vertices in planar graphs. 413-421
• 
  F. Dahme, Dieter Rautenbach, Lutz Volkmann: Some remarks on alpha-domination. 423-430
• 
  Mekkia Kouider, Preben D. Vestergaard: Even [a, b]-factors in graphs. 431-441
• 
  Monika Pilsniak: Packing of three copies of a digraph into the transitive tournament. 443-456
• 
  Teresa W. Haynes, Michael A. Henning, Lora Hopkins: Total domination subdivision numbers of graphs. 457-467
• 
  Joanna Polcyn: Short paths in 3-uniform quasi-random hypergraphs. 469-484
• 
  Igor E. Zverovich, Olga I. Zverovich: Dominant-matching graphs. 485-490
• 
  Sarah Bendall, Richard Hammack: Centers of n-fold tensor products of graphs. 491-501
• 
  Gábor Bacsó, Zsolt Tuza: Graphs without induced P₅ and C₅. 503-507
• 
  Martin Sonntag: Difference labelling of digraphs. 509-527
• 
  Hortensia Galeana-Sánchez: Cycle-pancyclism in bipartite tournaments II. 529-538
• 
  Sanming Zhou: A Gallai-type equality for the total domination number of a graph. 539-543

• 
  Lucien Haddad, Claude Tardif: A clone-theoretic formulation of the Erdös-Faber-Lovász conjecture. 545-549

last updated on Tue May 21 02:53:11 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page