Journal: Discussiones Mathematicae Graph Theory

Volume 41, Issue 4

853 -- 872Camino Balbuena, Cristina Dalfó, Berenice Martínez-Barona. (1, \le l)-identifying code
873 -- 891Mohammad Reza Darafsheh, M. Shahsavaran. p prime
893 -- 904Qiaoping Guo, Wei Meng. Outpaths of arcs in regular 3-partite tournaments
905 -- 921Pingge Chen, Jinhua Liang, Yuejian Peng. {123, 234, 456} and the Turán number of its extension
923 -- 948David Offner, Kerry Ojakian. Capture-time extremal cop-win graphs
949 -- 961Faraha Ashraf, Martin Baca, Muhammad Naeem 0005, Andrea Semanicová-Fenovcíková, Muhammad Kamran Siddiqui. H-irregularity strengths of some graphs
963 -- 980Peter Adams 0001, Saad I. El-Zanati, Ugur Odabasi, Wannasiri Wannasit. The spectrum problem for the connected cubic graphs of order 10
981 -- 999Aijun Dong, Tong Li. Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
1001 -- 1020Nicolas Gastineau, Oliver Togni. th power of the face-centered cubic grid
1021 -- 1040Sylwia Cichacz, Agnieszka Görlich, Zsolt Tuza. 2-cordial cycle-free hypergraphs
1041 -- 1050Petr Kovár, Michal Kravcenko, Matéj Krbecek, Adam Silber. Supermagic graphs with many different degrees
1051 -- 1066Shunsuke Nakamura. Distribution of contractible edges and the structure of noncontracible edges having endvertices with large degree in a 4-connected graph
1067 -- 1075Xue-Gang Chen, Yu-feng Wang, Xiao-Fei Wu. Hereditary equality of domination and exponential domination in subcubic graphs
1077 -- 1089Paul Manuel. On the isometric path partition problem
1091 -- 1101Madelynn Chase, Isaac Kadera, Jeffrey A. Mudrock, Ezekiel Thornburgh, Tim Wagstrom. A note on the equitable choosability of complete bipartite graphs
1103 -- 1114Naoki Matsumoto, Yusuke Suzuki. Non 1-planarity of lexicographic products of graphs
1115 -- 1125Robert Jajcay, Tom Raiman. g
1127 -- 1145Norbert Polat. On antipodal and diametrical partial cubes
1147 -- 1163Hanna Furmanczyk, Rita Zuazua. Equitable total coloring of corona of cubic graphs
1165 -- 1178Aleksandra Tepeh. Total domination in generalized prisms and a new domination invariant
1179 -- 1197Jakkepalli Pavan Kumar, P. Venkata Subba Reddy 0001. Algorithmic aspects of secure connected domination in graphs
1199 -- 1213Modjtaba Ghorbani, Sandi Klavzar, Hamid Reza Maimani, Mostafa Momeni, F. Rahimi Mahid, Gregor Rus. The general position problem on Kneser graphs and on some graph operations
1215 -- 1233Max Marsh, Jeffrey A. Mudrock, Tim Wagstrom. On list equitable total colorings of the generalized theta graph

Volume 41, Issue 3

695 -- 695Ewa Drgas-Burchardt, Elzbieta Sidorowicz. Preface 2019
697 -- 711Maryam Alipour, Peter Tittmann 0001. Graph operations and neighborhood polynomials
713 -- 724Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen, Christian Rubio-Montiel. Achromatic numbers for circulant graphs and digraphs
725 -- 747Ez-Zobair Bidine, Taoufiq Gadi, Mustapha Kchikech. Independence number and packing coloring of generalized Mycielski graphs
749 -- 762Bostjan Bresar, Bert L. Hartnell, Michael A. Henning, Kirsti Kuenzel, Douglas F. Rall. A new framework to approach Vizing's conjecture
763 -- 777Csilla Bujtás. Domination number of graphs with minimum degree five
779 -- 800Narda Cordero-Michel, Hortensia Galeana-Sánchez. Alternating-pancyclism in 2-edge-colored graphs
801 -- 808Július Czap, Igor Fabrici, Stanislav Jendrol'. Colorings of plane graphs without long monochromatic facial paths
809 -- 826Trung Duy Doan, Ingo Schiermeyer. Proper rainbow connection number of graphs
827 -- 847Michael A. Henning, Jerzy Topp. Minimal graphs with disjoint dominating and paired-dominating sets

Volume 41, Issue 2

345 -- 364Hossein Abdollahzadeh Ahangar, Jafar Amjadi, Mustapha Chellali, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami. Total 2-rainbow domination numbers in trees
365 -- 379Vladimir Samodivkin. Changing and unchanging of the domination number of a graph: path addition numbers
381 -- 390Chula J. Jayawardene, David Narváez, Stanislaw P. Radziszowski. 4
391 -- 408José Manuel Campero-Alonzo, Rocío Sánchez-López. H-colored quasi-transitive digraphs
409 -- 425Zemin Jin, Bin Sheng, Yuefang Sun. The minimum size of a graph with given tree connectivity
427 -- 439Zehui Shao, Enqiang Zhu. On the star chromatic index of generalized Petersen graphs
441 -- 450Robert Janczewski, Anna Maria Trzaskowska, Krzysztof Turowski. T-colorings, divisibility and circular chromatic number
451 -- 468Tay-Woei Shyu. Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
469 -- 479Hui Jiang, Wenjing Li, Xueliang Li 0001, Colton Magnant. On proper (strong) rainbow connection of graphs
481 -- 501Nawarat Ananchuen, Chanun Lewchalermvongs. 8}-minor
503 -- 511Edita Mácajová, Martin Skoviera. Critical and flow-critical snarks coincide
513 -- 530Xueliang Li 0001, Hengzhe Li, Yingbin Ma. The vertex- rainbow connection number of some graph operations
531 -- 558Bei Niu, Xin Zhang 0017. (p, 1)-total labelling of some 1-planar graphs
559 -- 587Hajo Broersma, Qin Ma, Yaping Mao, Jichang Wu. Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph
589 -- 599Nina Zublirina. Asymptotic behavior of the edge metric dimension of the random graph
601 -- 616Angsuman Das. Triameter of graphs
617 -- 632Trung Duy Doan, Ingo Schiermeyer. Conflict-free vertex connection number at most 3 and size of graphs
633 -- 645Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning. Restrained domination in self-complementary graphs
647 -- 664Majid Hajian, Nader Jafari Rad. Fair total domination number in cactus graphs
665 -- 684Christina M. Mynhardt, Joanna Raczek. Block graphs with large paired domination multisubdivision number
685 -- 690Ruixia Wang. k-quasi-transitive digraphs with large diameter

Volume 41, Issue 1

5 -- 38Július Czap, Mirko Hornák, Stanislav Jendrol'. A survey on the cyclic coloring and its relaxations
39 -- 49Hamideh Aram, Nasrin Dehgardi, Seyed Mahmoud Sheikholeslami, Mina Valinavaz, Lutz Volkmann. Domination, independent domination number and 2-independence number in trees
51 -- 64Ming Chen, Yusheng Li, Li Zhang 0022. Linear list coloring of some sparse graph
65 -- 73Tomás Madaras, Pavol Siroczki. Minimal graphs with respect to geometric distance realizability
75 -- 82Qiaoping Guo, Wei Meng. m
83 -- 101Dmitri V. Karpov. Large contractible subgraphs of a 3-connected graph
103 -- 121Thomas Schweser. Generalized hypergraph coloring
123 -- 132William F. Klostermeyer, Margaret-Ellen Messinger, Anders Yeo. Dominating vertex covers: the vertex-edge domination problem
133 -- 152Gee-Choon Lau, Ho Kuen Ng, Wai Chee Shiu. On local antimagic chromatic number of cycle-related join graphs
153 -- 166N. R. Aravind, C. R. Subramanian. Intersection dimension and graph invariants
167 -- 181Ligong Wang, Wojciech Widel, Wei Zheng. On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs
183 -- 197Yuanqiu Huang, Yuxi Wang. The crossing number of Cartesian product of 5-wheels with any tree
199 -- 211Linna Hu, Lei Sun, Jian-Liang Wu. List edge coloring of planar graphs without 6-cycles with two chords
213 -- 224Abel Cabrera Martínez, Iztok Peterin, Ismael González Yero. Independent transversal total domination versus total domination in trees
225 -- 247Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Tilen Marc, Balázs Patkós, Zsolt Tuza, Máté Vizer. On Grundy total domination number in product graphs
249 -- 266P. Paulraja, R. Srimathi. Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6
267 -- 283Abel Cabrera Martínez, Dorota Kuziak, Ismael González Yero. A constructive characterization of vertex cover Roman trees
285 -- 296Terry A. McKee. Dualizing distance-hereditary graphs
297 -- 310Wei Meng. Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments
311 -- 334Leonid Plachta. Coverings of cubic graphs and 3-edge colorability
335 -- 339Richard Hammack. Graph exponentiation and neighborhood reconstruction