Journal: Discussiones Mathematicae Graph Theory

Volume 37, Issue 4

845 -- 857Lianying Miao, Wenyao Song. Strong edge-coloring of planar graphs
859 -- 871Majid Hajian, Nader Jafari Rad. On the Roman domination stable graphs
873 -- 890Sarah E. Anderson, Yaoqi Guo, Asa Tenney, Kirsti Wash. Prime factorization and domination in the hierarchical product of graphs
891 -- 918Sylvain Gravier, Élise Vandomme. (r, a, b)-covering codes
919 -- 934Anant P. Godbole, Elizabeth Kelley, Emily Kurtz, Pawel Pralat, Yiguang Zhang. The total acquisition number of the randomly weighted path
935 -- 951Tingzeng Wu, Heping Zhang. Per-spectral characterizations of some bipartite graphs
953 -- 961José D. Alvarado, Simone Dantas, Dieter Rautenbach. Relating 2-rainbow domination to Roman domination
963 -- 973Susan A. van Aardt. Every 8-traceable oriented graph is traceable
975 -- 988Yuefang Sun. A sharp lower bound for generalized 3-edge-connectivity of strong product graphs
989 -- 1004Maryam Atapour, Nasrin Dehgardi. Twin minus total domination numbers in directed graphs
1005 -- 1013Richard Hammack, Dewey T. Taylor. Proper connection of direct products
1015 -- 1025Éric Duchêne, Hamamache Kheddouci, Mohammed Amin Tahraoui, Mariusz Wozniak. (n, n-2)-graphs in their complements
1027 -- 1038Lutz Volkmann. k-domatic number of a graph
1039 -- 1053Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami. Signed total Roman edge domination in graphs
1055 -- 1065Jiancheng Wu, Tao Zhang, Sizhong Zhou. ≥3-factor covered graphs
1067 -- 1078Faraha Ashraf, Martin Baca, Marcela Lascsáková, Andrea Semanicová-Fenovcíková. H-irregularity strength of graphs
1079 -- 1094Hanna Furmanczyk, Marek Kubale, Vahan Mkrtchyan. Equitable colorings of corona multiproducts of graphs

Volume 37, Issue 3

505 -- 522Jing Luo, Runze Wan, Zhongxun Zhu. On the Laplacian coefficients of tricyclic graphs with prescribed matching number
523 -- 535R. S. Manikandan, P. Paulraja. 7-decompositions of the tensor product of complete graphs
537 -- 545Meiyu Wang, Shiying Wang, Lei Zhang. k-restricted edge connected
547 -- 560Alejandro Estrada-Moreno, Juan Alberto Rodríguez-Velázquez, Erick D. Rodríquez-Bazan. On generalized Sierpi?ski graphs
561 -- 572Yichao Chen, Yan Yang. The thickness of amalgamations and Cartesian product of graphs
573 -- 586Walter Carballosa, Ruy Fabila Monroy, Jesús Leaños, Luis Manuel Rivera-Martínez. Regularity and planarity of token graphs
587 -- 594Terry A. McKee. Characterizing atoms that result from decomposition by clique separators
595 -- 609Ravindra B. Bapat, Masoud Karimi. Construction of cospectral integral regular graphs
611 -- 622Kecai Deng, Xiaoling Zhang. L(2, 1, 1)-labeling problem on trees
623 -- 632Yuefang Sun. k-connectivity
633 -- 647S. Devi Yamini, M. A. Shalu. One-three join: A graph operation and its consequences
649 -- 663Charles B. Crane. (k, m)-pancyclicity
665 -- 690Isma Bouchemakh, Laïche Daouya, Éric Sopena. Packing coloring of some undirected and oriented coronae graphs
691 -- 710Binlong Li, Bo Ning. Heavy subgraphs, stability and Hamiltonicity
711 -- 727Gary Chartrand, Sean English, Ping Zhang 0004. Kaleidoscopic colorings of graphs
729 -- 744Jing Huang, Shuchao Li. On the spectral characterizations of graphs
745 -- 754R. Sundara Rajan, R. Jayagopal, Paul D. Manuel, Mirka Miller, Indra Rajasingh. A note on the locating-total domination in graphs
755 -- 776Vojtech Rödl, Andrzej Rucinski 0001, Mathias Schacht. Ramsey properties of random graphs and Folkman numbers
777 -- 787Elena V. Konstantinova. Chromatic properties of the Pancake graphs
789 -- 795Liying Kang, Yi Lin, Erfang Shan. Asymptotic sharpness of bounds on hypertrees
797 -- 809Shoichoi Tsuchiya, Takamasa Yashima. [2, b]-factors in graphs
811 -- 822Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Brent J. Thomas. Saturation spectrum of paths and stars
823 -- 834Peter Dankelmann, Elizabeth Jonck, Tomás Vetrík. The degree-diameter problem for outerplanar graphs
835 -- 840Saieed Akbari, Shahab Haghi, Hamid Reza Maimani, Abbas Seify. On double-star decomposition of graphs

Volume 37, Issue 2

299 -- 299Ewa Drgas-Burchardt, Elzbieta Sidorowicz. Preface
301 -- 313Jesús Alva-Samos, Juan José Montellano-Ballesteros. Rainbow connectivity of cacti and some infinite digraphs
315 -- 336Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt. Forbidden structures for planar perfect consecutively colourable graphs
337 -- 352Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj. How long can one bluff in the domination game?
353 -- 368Július Czap, Stanislav Jendrol', Juraj Valiska. WORM colorings of planar graphs
369 -- 381Michael A. Henning, Christian Löwenstein. Domination game: extremal families for 3/5-conjecture for forests
383 -- 397Ferran Hurtado, Mercè Mora, Eduardo Rivera-Campo, Rita Zuazua. Distance 2-domination in prisms of graphs
399 -- 413Marián Klesc, Jana Petrillová, Matús Valo. On the crossing numbers of Cartesian products of wheels and trees
415 -- 426Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer. On sequential heurestic methods for the maximum independent set problem
427 -- 441Anna Malafiejska, Michal Malafiejski. Interval incidence coloring of subcubic graphs
443 -- 464Joanna Polcyn. One more Turán number and Ramsey number for the loose 3-uniform path of length three
465 -- 476Katarzyna Rybarczyk. The chromatic number of random intersection graphs
477 -- 500Wojciech Widel. A triple of heavy subgraphs ensuring pancyclity of 2-connected graphs

Volume 37, Issue 1

5 -- 12Oleg V. Borodin, Anna O. Ivanova. All tight descriptions of 3-stars in 3-polytopes with girth 5
13 -- 28Yury Metelsky, Kseniya Schemeleva, Frank Werner 0001. A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of thresholds graphs
29 -- 37Evelyne Flandrin, Hao Li, Antoni Marczyk, Jean-François Saclé, Mariusz Wozniak. A note on neighbor expanded sum distinguishing index
39 -- 53Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann. k-domination in graphs
55 -- 62Dalibor Froncek. Decomposition of certain complete bipartite graphs into prisms
63 -- 77William F. Klostermeyer, Gary MacGillivray. Eternal domination: criticality and reachability
79 -- 88Erhard Hexel. H-force number of Hamiltonian graphs and cycle extendability
89 -- 115Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak. Structural properties of recursively partitionable graphs with connectivity 2
117 -- 129Patricio Ricardo Garcia-Vázquez, César Hernández-Cruz. Some results on 4-transitive digraphs
131 -- 140Bhagyashree Y. Bam, Charusheela M. Deshpande, Lata N. Kamble. Almost self-complementary 3-uniform hypergraphs
141 -- 154Xueliang Li 0001, Hengzhe Li, Yuefang Sun. Rainbow connection number of graphs with diameter 3
155 -- 164Ehsan Estaji, Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Thomas W. Tucker. Distinguishing Cartesian products of countable graphs
165 -- 174Poppy Immel, Paul S. Wenger. The list distinguishing number equals the distinguishing number for interval graphs
175 -- 209Houmem Belkhechine, Pierre Ille, Robert E. Woodrow. Criticality of switching classes of reversible 2-structures labeled by an Abelian group
211 -- 220Julien Bensmail. q-power cycles in cubic graphs
221 -- 238Nahid Javier, Bernardo Llano. The dichromatic number of infinite families of circulant tournaments
239 -- 249Sylwia Cichacz, Mateusz Nikodem. Union of distance magic graphs
251 -- 259Ji-Yuo Guo, Jian-Hua Yin. s, t-bigraphic pairs
261 -- 272Lutz Volkmann. Signed total Roman domination in digraphs
273 -- 293Dorota Kuziak, Juan Alberto Rodríguez-Velázquez, Ismael González Yero. Computing the metric dimension of a graph from primary subgraphs