Discussiones Mathematicae Graph Theory, Volume 31
Volume 31, Number 1, 2011
- Ghidewon Abay-Asmerom, Richard Hammack, Craig E. Larson, Dewey T. Taylor: Notes on the independence number in the Cartesian product of graphs. 25-35
- Andrew Breiner, Jitender S. Deogun, Pierre Ille: Decomposition tree and indecomposable coverings. 37-44
- Paul Martinez, Juan Ortiz, Maggy Tomova, Cindy Wyels: Radio numbers for generalized prism graphs. 45-62
- Ramón M. Figueroa-Centeno, Rikio Ichishima, Francesc A. Muntaner-Batle, Akito Oshima: A magical approach to some labeling conjectures. 79-113
- Piotr Borowiecki, Kristína Budajová, Stanislav Jendrol, Stanislav Krajci: Parity vertex colouring of graphs. 183-195
- Mostafa Blidia, Widad Dali: A characterization of locating-total domination edge critical graphs. 197-202
Volume 31, Number 2, 2011
- Mieczyslaw Borowiecki, Arnfried Kemnitz, Massimiliano Marangio, Peter Mihók: Generalized total colorings of graphs. 209-222
- Csilla Bujtás, Zsolt Tuza, Vitaly I. Voloshin: Color-bounded hypergraphs, V: host graphs and subdivisions. 223-238
- Emilia Drazenská, Marián Klesc: On the crossing numbers of G\Box Cn for graphs G on six vertices. 239-252
- Hortensia Galeana-Sánchez: Kernels by monochromatic paths and the color-class digraph. 273-281
- Hortensia Galeana-Sánchez, G. Gaytán-Gómez, Rocío Rojas-Monroy: Monochromatic cycles and monochromatic paths in arc-colored digraphs. 283-292
- Hortensia Galeana-Sánchez, César Hernández-Cruz: k-kernels in generalizations of transitive digraphs. 293-312
- Marián Klesc, Stefan Schrötter: The crossing numbers of join products of paths with graphs of order four. 321-331
- Petros A. Petrosyan: Interval edge colorings of some products of graphs. 357-373
- Joanna Raczek: Graphs with equal domination and 2-distance domination numbers. 375-385
- Ingo Schiermeyer: Bounds for the rainbow connection number of graphs. 387-395
Volume 31, Number 3, 2011
- Lutz Volkmann: Signed domination and signed domatic numbers of digraphs. 415-427
- Yuehua Bu, Ko-Wei Lih, Weifan Wang: Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. 429-439
- Douglas R. Woodall: Defective choosability of graphs in surfaces. 441-459
- A. P. Santhakumaran, P. Titus: The connected forcing connected vertex detour number of a graph. 461-473
- Lynne L. Doty: Bounding neighbor-connectivity of Abelian Cayley graphs. 475-491
- Klaus Dohmen: An inductive proof of Whitney's Broken Circuit Theorem. 509-515
- Gerd Fricke, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson: γ-graphs of graphs. 517-531
- Grady Bullington, Linda Eroh, Ralucca Gera, Steven J. Winters: Closed k-stop distance in graphs. 533-545
- Laura Frigerio, Federico Lastaria, Norma Zagaglia Salvi: Adjacent vertex distinquishing edge colorings of the direct product of a regular graph by a path or cycle. 547-557
- Terry A. McKee: Simplicial and nonsimplicial complete subgraphs. 577-586
- Y. M. Borse, Kiran Dalvi, M. M. Shikare: Forbidden-minor characterization for the class of cographic element splitting matroids. 601-606
Volume 31, Number 4, 2011
- Johnson John, A. P. Santhakumaran: On the forcing geodetic and forcing Steiner numbers of a graph. 611-624
- Mustapha Chellali, Lutz Volkmann: Characterization of trees with equal 2-domination number and domination number plus two. 687-697
- Lutz Volkmann: Connected global offensive k-alliances in graphs. 699-707
- Mais Alkhateeb, Anja Kohl: Upper bounds on the b-chromatic number and results for restricted graph classes. 709-735
- Sakib A. Mondal: Planar graphs without 4-, 5- and 8-cycles are 3-colorable. 775-789
- Pietra Delgado-Escalante, Hortensia Galeana-Sánchez: On monochromatic paths and bicolored subdigraphs in arc-colored tournaments. 791-820
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team