Journal: Discussiones Mathematicae Graph Theory

Volume 38, Issue 2

323 -- 349Mieczyslaw Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz. P-apex graphs
351 -- 370Yuanqiu Huang, Zhangdong Ouyang, Jing Wang. P(3, 1) with path and cycle
371 -- 384Xueliang Li 0001, Colton Magnant, Meiqin Wei, Xiaoyu Zhu. Generalized rainbow connection of graphs and their complements
385 -- 396Yun-Ping Deng, Haichao Wang, Yancai Zhao. The complexity od secure domination problem in graphs
397 -- 404Shahab Haghi, Hamid Reza Maimani. A note on the Ramsey number of even wheels versus stars
405 -- 427Olga Bodroza-Pantic, Rade Doroslovacki, Harris Kwong, Milan Pantic. A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs
429 -- 442Lingping Zhong. The minimum harmonic index for unicyclic graphs with given diameter
443 -- 453Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova. More about the height of faces in 3-polytopes
455 -- 462Nader Jafari Rad, Hadi Rahbani. Bounds on the locating-domination number and differentiating-total domination number in trees
463 -- 476Mirko Hornák, Juraj Hudák. On the palette index of complete bipartite graphs
477 -- 490Tingting Han, Ruijuan Li. Arc-disjont Hamiltonian cycles in round decomposable locally semicomplete digraphs
491 -- 498Fuhong Ma, Jin Yan. On the number of disjoint 4-cycles in regular tournaments
499 -- 513R. Rasi, Seyed Mahmoud Sheikholeslami. The smallest harmonic index of trees with given maximum degree
515 -- 524Mohammad Reza Oboudi. Some results on the independence polynomial of unicyclic graphs
525 -- 552Nibedita Mandal, Pratima Panigrahi. L(2, 1)-coloring of edge-multiplicity-paths-replacement graph
553 -- 571Sally Cockburn. Homomorphic preimages of geometric paths
573 -- 586Joanna Cyman, Magda Dettlaff, Michael A. Henning, Magdalena Lemanska, Joanna Raczek. Total domination in versus paired-domination in regular graphs
587 -- 605Zhenming Bi, Gary Chartrand, Ping Zhang 0004. Another view of bipartite Ramsey numbers
607 -- 610Adam Pawel Wojda. Almost self-complementary uniform hypergraphs