GEODESIC
Revues
Séminaires
Livres
Congrès
Sources
Discussiones Mathematicae Graph Theory
Tome 31 (2011)
no. 2
Sommaire
Preface
p. 207
Generalized total colorings of graphs
Mieczysław Borowiecki
;
Arnfried Kemnitz
;
Massimiliano Marangio
;
Peter Mihók
p. 209
Color-bounded hypergraphs, V: host graphs and subdivisions
Csilla Bujtás
;
Zsolt Tuza
;
Vitaly Voloshin
p. 223
On the crossing numbers of G □ Cₙ for graphs G on six vertices
Emília Draženská
;
Marián Klešč
p. 239
On Fulkerson conjecture
Jean-Luc Fouquet
;
Jean-Marie Vanherpe
p. 253
Kernels by monochromatic paths and the color-class digraph
Hortensia Galeana-Sánchez
p. 273
Monochromatic cycles and monochromatic paths in arc-colored digraphs
Hortensia Galeana-Sánchez
;
Guadalupe Gaytán-Gómez
;
Rocío Rojas-Monroy
p. 283
k-kernels in generalizations of transitive digraphs
Hortensia Galeana-Sánchez
;
César Hernández-Cruz
p. 293
Graphs with rainbow connection number two
Arnfried Kemnitz
;
Ingo Schiermeyer
p. 313
The crossing numbers of join products of paths with graphs of order four
Marián Klešč
;
Stefan Schrötter
p. 321
On doubly light vertices in plane graphs
Veronika Kozáková
;
Tomáš Madaras
p. 333
Generalized circular colouring of graphs
Peter Mihók
;
Janka Oravcová
;
Roman Soták
p. 345
Interval edge colorings of some products of graphs
Petros A. Petrosyan
p. 357
Graphs with equal domination and 2-distance domination numbers
Joanna Raczek
p. 375
Bounds for the rainbow connection number of graphs
Ingo Schiermeyer
p. 387
Distance independence in graphs
J. Louis Sewell
;
Peter J. Slater
p. 397