Journal: Discussiones Mathematicae Graph Theory

Volume 24, Issue 3

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

Volume 24, Issue 2

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

Volume 24, Issue 1

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