Journal: Discussiones Mathematicae Graph Theory

Volume 43, Issue 4

879 -- 893Simone Dantas, Rodrigo Marinho, Myriam Preissmann, Diana Sasaki. New results on Type 2 snarks
895 -- 907Sopon Boriboon, Teeradej Kittipassorn. The graph grabbing game on blow-ups of trees and cycles
909 -- 930Stephan Dominique Andres. Strong and weak Perfect Digraph Theorems for perfect, α-perfect and strictly perfect digraphs
931 -- 946Teresa W. Haynes, Jason Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan. Coalition graphs of paths, cycles, and trees
947 -- 963Subhabrata Paul, Dinabandhu Pradhan, Shaily Verma. Vertex-edge domination in interval and bipartite permutation graphs
965 -- 978Wenyao Song, Lianying Miao, Yueying Zhao, Haiyang Zhu. Acyclic chromatic index of IC-planar graphs
979 -- 997Arnfried Kemnitz, Massimiliano Marangio. On the ρ-subdivision number of graphs
999 -- 1017Péter G. N. Szabó. A characterization of uniquely representable graphs
1019 -- 1032Zbigniew R. Bogdanowicz. On q-connected chordal graphs with minimum number of spanning trees
1033 -- 1061Guoliang Hao, Zhihong Xie, Seyed Mahmoud Sheikholeslami, M. Hajjari. Bounds on the total double Roman domination number of graphs
1063 -- 1090Hayat Issaadi, Hacène Aït Haddadène, Hamamache Kheddouci. 5-free locally split graphs
1091 -- 1102Mateja Sajna, Andrew Wagner. ℓ-covering k-hypergraphs are quasi-eulerian
1103 -- 1121Mirko Hornák. q equals 2q+3 if q≥41 is odd
1123 -- 1146Soogang Eoh, Myungho Choi, Suh-Ryung Kim. The niche graphs of multipartite tournaments
1147 -- 1169Aleksandra Gorzkowska, Michael A. Henning, Monika Pilsniak, Elzbieta Tumidajewicz. Total and paired domination stability in prisms
1171 -- 1194Gabriela Araujo-Pardo, Fidel Barrera-Cruz, Natalia García-Colín. Biregular (and regular) planar cages
1195 -- 1202Dang Hanh. 1, 4-free graph
1203 -- 1213Stefan Ehard, Elena Mohr, Dieter Rautenbach. Biholes in balanced bipartite graphs
1215 -- 1235Mehmet Akif Yetim. L(p, q)-labeling of graphs with interval representations
1237 -- 1252Claudson F. Bornstein, Gila Morgenstern, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter. k-VPG graphs
1253 -- 1272Yanhong Gao, Ping Li 0025, Xueliang Li 0001. Extremal graphs and classification of planar graphs by MC-numbers

Volume 43, Issue 3

587 -- 606Doost Ali Mojdeh, Babak Samadi. Total 2-domination number in digraphs and its dual parameter
607 -- 618Louis DeBiasio, Robert A. Krueger. A note about monochromatic components in graphs of large minimum degree
619 -- 634Randy Davila, Michael A. Henning, Ryan Pepper. Zero and total forcing dense graphs
635 -- 657Zhen-Kun Zhang. Edge-maximal graphs with cutwidth at most three
659 -- 675Liliana Alcón, Marisa Gutierrez, Carmen Hernando 0001, Mercè Mora, Ignacio M. Pelayo. The neighbor-locating-chromatic number of trees and unicyclic graphs
677 -- 683Zdzislaw Skupien. The Petersen and Heawood graphs make up graphical twins via induced matchings
685 -- 702Peter Dankelmann, Matthew DeVilbiss, David J. Erwin, Kelly Guest, Ryan Matzke. On subgraphs with prescribed eccentricities
703 -- 720Dmitri V. Karpov. An upper bound on the chromatic number of 2-planar graphs
721 -- 730Lutz Volkmann. Double Roman and double Italian domination
731 -- 742Xiaomin Zhou, Weihua Yang, Xiaxia Guan, Chengfu Qin. 2}}-minor-free graphs
743 -- 760Jean-Christophe Godin, Olivier Togni. Choosability with separation of cycles and outerplanar graphs
761 -- 766Sizhong Zhou, Qiuxiang Bian, Zhiren Sun. Two sufficient conditions for component factors in graphs
767 -- 792F. M. Abdelmalek, Esther Vander Meulen, Kevin N. Vander Meulen, Adam Van Tuyl. Well-covered token graphs
793 -- 807Beka Ergemlidze, Abhishek Methuku, Michael Tait, Craig Timmons. s-saturated graph
809 -- 824Jochen Harant, Samuel Mohr. New bounds on domination and independence in graphs
825 -- 840Michael A. Henning, Saikat Pal, Dinabandhu Pradhan. Hop domination in chordal bipartite graphs
841 -- 858Liliana Alcón, María Pía Mazzoleni, Tanilson D. Santos. 1-EPG, VPT and EPT graphs classes
859 -- 874MacKenzie Carr, Christina M. Mynhardt, Ortrud R. Oellermann. Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs

Volume 43, Issue 2

303 -- 312Lin-peng Zhang, Ligong Wang 0001, Jiale Zhou. The Turán number of spanning star forests
313 -- 329Tijo James, Ambat Vijayakumar. Domination game: Effect of edge contraction and edge subdivision
331 -- 349Roland Lortz, Ingrid Mengersen. On the Ramsey numbers of non-star trees versus connected graphs of order six
351 -- 384Flor Aguilar-Campos, Gabriela Araujo-Pardo, Natalia García-Colín. Scaffold for the polyhedral embedding of cubic graphs
385 -- 399Arman Aashtab, Saieed Akbari, Maryam Ghanbari, Amitis Shidani. Vertex partitioning of graphs into odd induced subgraphs
401 -- 419Gyula Y. Katona, Kitti Varga. Strengthening some complexity results on toughness of graphs
421 -- 436Tanja Dravec, Andrej Taranenko. Daisy Hamming graphs
437 -- 444Jianhua Yin, Bing Wang. s, t
445 -- 455Devin C. Jean, Suk Jai Seo. Optimal error-detecting open-locating-dominating set on the infinite triangular grid
457 -- 462Shimon Kogan. A note on forcing 3-repetitions in degree sequences
463 -- 486Neeta Shinde, Smruti Mane, Baloo Waphare. Identifying codes in the direct product of a path and a complete graph
487 -- 498Peter Dankelmann, Jane Morgan, Emily Rivett-Carnac. Metric dimension and diameter in bipartite graphs
499 -- 506John Haslegrave. Countable graphs are majority 3-choosable
507 -- 532Irene Sciriha, Luke Collins. The walks and CDC of graphs with the same main eigenspace
533 -- 547Sergey Kitaev, Artem V. Pyatkin. On semi-transitive orientability of triangle-free graphs
549 -- 572Dániel Gerbner. Generalized Turán problems for small graphs
573 -- 581Ngo Dac Tan. A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths

Volume 43, Issue 1

5 -- 16Guowei Dai. The existence of path-factor covered graphs
17 -- 34J. B. Saraf, Y. M. Borse, Ganesh Mundhe. On conditional connectivity of the Cartesian product of cycles
35 -- 53Teresa W. Haynes, Michael A. Henning. Unique minimum semipaired dominating sets in trees
55 -- 76Jacob White. Burnside chromatic polynomials of group-invariant graphs
77 -- 94Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan. Equimatchable bipartite graphs
95 -- 114Amanda Burcroff. Domination parameters of the unitary Cayley graph of ℤ/nℤ
115 -- 135William Klostermeyer, Gary MacGillivray, Saeed Semnani, Farzaneh Piri. Efficient (j, k)-dominating functions
137 -- 149Jaume Martí-Farré, Mercè Mora, María Luz Puertas, José Luis Ruiz. Elimination properties for minimal dominating sets of graphs
151 -- 158Kenny Storgel. Improved bounds for some facially constrained colorings
159 -- 169Pawel Wocjan, Clive Elphick, David Anekstein. More tales of Hoffman: bounds for the vector chromatic number of a graph
171 -- 177Hikari Shibuya, Yusuke Suzuki. A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces
179 -- 194Yingzhi Tian, Hong-Jian Lai, Jixiang Meng, Murong Xu. On the sizes of (k, l)-edge-maximal r-uniform hypergraphs
195 -- 210Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann. The threshold dimension and irreducible graphs
211 -- 224Xiaojing Yang, Liming Xiong. Forbidden subgraphs for existences of (connected) 2-factors of a graph
225 -- 231Linda M. Lesniak, Henri Thuiller, Adam Pawel Wojda. Extending Poto?nik and ?ajna's conditions on the existence of vertex-transitive self-complementary k-hypergraphs
233 -- 244Sizhong Zhou. Some results on path-factor critical avoidable graphs
245 -- 275Anni Hakanen, Ville Junnila, Tero Laihonen, María Luz Puertas. On the metric dimensions for sets of vertices
277 -- 286Peter Borg, Carl Feghali. The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
287 -- 297Sarawute Sribunhung, Keaitsuda Nakprasit, Kittikorn Nakprasit, Pongpat Sittitrai. Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles