GEODESIC
Revues
Séminaires
Livres
Congrès
Sources
Discussiones Mathematicae Graph Theory
Tome 25 (2005)
Sommaire du
Fascicule no. 1-2
On domination in graphs
Frank Göring
;
Jochen Harant
p. 7
Graphs with large double domination numbers
Michael A. Henning
p. 13
On double domination in graphs
Jochen Harant
;
Michael A. Henning
p. 29
Total domination in categorical products of graphs
Douglas F. Rall
p. 35
Planar Ramsey numbers
Izolda Gorgol
p. 45
Domination numbers in graphs with removed edge or set of edges
Magdalena Lemańska
p. 51
Multicolor Ramsey numbers for paths and cycles
Tomasz Dzido
p. 57
Maximal hypergraphs with respect to the bounded cost hereditary property
Ewa Drgas-Burchardt
;
Anna Fiedorowicz
p. 67
Note on the split domination number of the Cartesian product of paths
Maciej Zwierzchowski
p. 79
Dominating bipartite subgraphs in graphs
Gábor Bacsó
;
Danuta Michalak
;
Zsolt Tuza
p. 85
Combinatorial lemmas for polyhedrons
Adam Idzik
;
Konstanty Junosza-Szaniawski
p. 95
On (k,l)-kernel perfectness of special classes of digraphs
Magdalena Kucharska
p. 103
Graph domination in distance two
Gábor Bacsó
;
Attila Tálos
;
Zsolt Tuza
p. 121
The cycle-complete graph Ramsey number r(C₅,K₇)
Ingo Schiermeyer
p. 129
Two variants of the size Ramsey number
Andrzej Kurek
;
Andrzej Ruciński
p. 141
Distance coloring of the hexagonal lattice
Peter Jacko
;
Stanislav Jendrol'
p. 151
Arithmetically maximal independent sets in infinite graphs
Stanisław Bylka
p. 167
Median and quasi-median direct products of graphs
Boštjan Brešar
;
Pranava K. Jha
;
Sandi Klavžar
;
Blaž Zmazek
p. 183
Some crossing numbers of products of cycles
Marián Klešč
p. 197
Note on partitions of planar graphs
Izak Broere
;
Bonita S. Wilson
;
Jozef Bucko
p. 211
Estimation of cut-vertices in edge-coloured complete graphs
Adam Idzik
p. 217
Coloring of G²∖G, for Euclidesian graph G
Konstanty Junosza-Szaniawski
p. 219
Preface
p. 5
Sommaire du
Fascicule no. 3
Connected odd dominating sets in graphs
Yair Caro
;
William F. Klostermeyer
;
Raphael Yuster
p. 225
On a conjecture of quintas and arc-traceability in upset tournaments
Arthur H. Busch
;
Michael S. Jacobson
;
K. Brooks Reid
p. 225
A tandem version of the cops and robber game played on products of graphs
Nancy E. Clarke
;
Richard J. Nowakowski
p. 241
Domination and leaf density in graphs
Anders Sune Pedersen
p. 251
Mycielskians and matchings
Tomislav Doslić
p. 261
On graphs G for which both g and G̅ are claw-free
Shinya Fujita
p. 267
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
Ralph J. Faudree
;
Ronald J. Gould
;
Michael S. Jacobson
p. 273
Exact double domination in graphs
Mustapha Chellali
;
Abdelkader Khelladi
;
Frédéric Maffray
p. 291
Hamilton decompositions of line graphs of some bipartite graphs
David A. Pike
p. 303
Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees
Michael Kubesa
p. 311
Decompositions into two paths
Zdzisław Skupień
p. 325
The directed path partition conjecture
Marietjie Frick
;
Susan van Aardt
;
Gcina Dlamini
;
Jean Dunbar
;
Ortrud Oellermann
p. 331
On the p-domination number of cactus graphs
Mostafa Blidia
;
Mustapha Chellali
;
Lutz Volkmann
p. 355
On γ-labelings of trees
Gary Chartrand
;
David Erwin
;
Donald W. VanderJagt
;
Ping Zhang
p. 363
A note on maximal common subgraphs of the Dirac's family of graphs
Jozef Bucko
;
Peter Mihók
;
Jean-François Saclé
;
Mariusz Woźniak
p. 385
An upper bound of the basis number of the strong product of graphs
Mohammed M.M. Jaradat
p. 391
Kernels in monochromatic path digraphs
Hortensia Galeana-Sánchez
;
Laura Pastrana Ramírez
;
Hugo Alberto Rincón Mejía
p. 407
On short cycles through prescribed vertices of a polyhedral graph
Erhard Hexel
p. 419
On a sphere of influence graph in a one-dimensional space
Zbigniew Palka
;
Monika Sperling
p. 427
Highly connected counterexamples to a conjecture on α-domination
Zsolt Tuza
p. 435