Journal: Discussiones Mathematicae Graph Theory

Volume 27, Issue 3

389 -- 400Hortensia Galeana-Sánchez, Luis Alberto Jiménez Ramírez. Monochromatic kernel-perfectness of special classes of digraphs
401 -- 407Guantao Chen, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer. Chvátal Erdós condition and 2-factors with a specyfied number of components
409 -- 423Robert R. Rubalcaba, Peter J. Slater. Efficient ::::(j, k)-::::domination
425 -- 455Douglas R. Woodall. Some totally 4-choosable multigraphs
457 -- 470Waldemar Szumny, Andrzej Wloch, Iwona Wloch. On ::::(k, l)::::-kernels in :::: D::::-join of digraphs
471 -- 483Jurriaan Hage, Tero Harju. Towards a characterization of bipartite switching classes by means of forbidden subgraphs
485 -- 506Gary Chartrand, Ladislav Nebesky, Ping Zhang 0004. Distance defined by spanning trees in graphs
507 -- 526Michael J. Ferrara, Ronald J. Gould, Stephen G. Hartke. The structure and existence of 2-factors in iterated line graphs
527 -- 540R. G. Gibson, Christina M. Mynhardt. Couterexample to a conjecture on the structure of bipartite partionable graphs
541 -- 547Matt Walsh. Fractional domination in prisms
553 -- 558Pooya Hatami. An approximation algorithm for the total covering problem
561 -- 0Waclaw Frydrych, Andrzej Zak. Preface to Proceedings
561 -- 563Zdzislaw Skupien. 3in1 enhanced: Three squares ways to 3in 1 GRAPHS
565 -- 582Stanislaw Bylka, Jan Komar. The representation of multi-hypergraphs by set intersections
583 -- 591Jaroslav Ivanco. Magic and supermagic dense bipartite graphs
593 -- 601Wilfried Imrich, Werner Klöckl. Factoring directed graphs with respect to the cardinal product in polynomial time
603 -- 610Martin Knor. Minimal non-selfcentric radially-maximal graphs of radius 4
611 -- 622Zyta Dziechcinska-Halamoda, Zofia Majcher, Jerzy Michael, Zdzislaw Skupien. A Sokoban-type game and arc deletion within irregular digraphs of all sizes

Volume 27, Issue 2

209 -- 227Premysl Holub. On distance local connectivity and vertex distance colouring
229 -- 240Ahmed Ainouche, Serge Lapiquonne. Variations on a sufficient condition for Hamiltonian graphs
241 -- 249Sylwia Cichacz. Decomposition of complete bipartite digraphs and even complete multigraphs into closed trails
251 -- 268S. M. Hegde, Mirka Miller. Futher results on sequetially additive graphs
269 -- 279Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin. Erdõs regular graphs of even degree
281 -- 297Yuejian Peng. Subgraph densities in hypergraphs
299 -- 311Bernardo Llano, Mika Olsen. Infinite families of tight regular tournaments
313 -- 321Sandi Klavzar, Matjaz Kovse. On ::::Tetha::::-graphs of partial cubes
323 -- 332Tomoki Yamashita. Vertex-dominating cycles in 2-connected bipartite graphs
333 -- 343Bostjan Bresar, Simon Spacapan. Edge-connectivity of strong products of graphs
345 -- 357Ludovít Niepel. Histories in path graphs
359 -- 371Hortensia Galeana-Sánchez, Ricardo Gómez. ::::(k, l)-::::kernels, ::::(k, l)-::::semikernels, ::::k-::::Grundy functions and duality for state splittings
373 -- 384Yi-Zheng Fan, Yi Wang, Jun Zhou. On the second largest eigenvalue of a mixed graph

Volume 27, Issue 1

5 -- 18Brice Effantin, Hamamache Kheddouci. Grundy number of graphs
19 -- 27Mustapha Chellali, Teresa W. Haynes. Global Alliances and Independence in Trees
29 -- 38Ingo Schiermeyer, Mariusz Wozniak. New sufficient conditions for hamiltonian and pancyclic graphs
39 -- 44Anthony Bonato. A note on uniquely ::::H::::-colorable graphs
45 -- 49Monika Pilsniak, Mariusz Wozniak. A note on packing of two copies of a hypergraph
51 -- 67Kim A. S. Factor, Larry J. Langley. Digraphs with underlying and domination graphs: Connected ::::UG:::c:::(D)::::
69 -- 82Yi-Zheng Fan, Shi-Cai Gong. Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two
83 -- 91Joanna Raczek. Trees with restrained domination and total restrained domination numbers
93 -- 103Adriana Hansberg Pastor, Lutz Volkmann. Characterization of block graphs with equal 2-domination number and domination number plus one
105 -- 123Mustapha Kchikech, Riadh Khennoufa, Olivier Togni. Linear and cyclic radio k-labelings of trees
125 -- 136Wayne Goddard, Kiran Kanakadandi. Orientation distance graphs revisited
137 -- 142Ingo Schiermeyer. A new upper bound for the chromatic number of a graph
143 -- 157Juan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta. Spectral study of alliances in graphs
159 -- 174Wenjie He, Yufa Shen, Guoping Zheng. Improved upper bounds for nearly antipodal chromatic number of paths
175 -- 178Xinmin Hou. Total domination of Cartesian products of graphs
179 -- 191Daniël Paulusma, Kiyoshi Yoshimoto. Cycles through specified vertices in triangle-free graphs
193 -- 204Abdollah Khodkar, Rui Xu. More on even ::::[a, b]::::-factors in graphs