Wang, Ruixia Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter. (English) Zbl 1458.05095 Discuss. Math., Graph Theory 41, No. 2, 685-690 (2021). MSC: 05C20 05C25 05C45 PDFBibTeX XMLCite \textit{R. Wang}, Discuss. Math., Graph Theory 41, No. 2, 685--690 (2021; Zbl 1458.05095) Full Text: DOI
Mynhardt, Christina M.; Raczek, Joanna Block graphs with large paired domination multisubdivision number. (English) Zbl 1458.05202 Discuss. Math., Graph Theory 41, No. 2, 665-684 (2021). MSC: 05C69 05C51 PDFBibTeX XMLCite \textit{C. M. Mynhardt} and \textit{J. Raczek}, Discuss. Math., Graph Theory 41, No. 2, 665--684 (2021; Zbl 1458.05202) Full Text: DOI
Hajian, Majid; Rad, Nader Jafari Fair total domination number in cactus graphs. (English) Zbl 1458.05195 Discuss. Math., Graph Theory 41, No. 2, 647-664 (2021). MSC: 05C69 PDFBibTeX XMLCite \textit{M. Hajian} and \textit{N. J. Rad}, Discuss. Math., Graph Theory 41, No. 2, 647--664 (2021; Zbl 1458.05195) Full Text: DOI
Desormeaux, Wyatt J.; Haynes, Teresa W.; Henning, Michael A. Restrained domination in self-complementary graphs. (English) Zbl 1458.05192 Discuss. Math., Graph Theory 41, No. 2, 633-645 (2021). MSC: 05C69 PDFBibTeX XMLCite \textit{W. J. Desormeaux} et al., Discuss. Math., Graph Theory 41, No. 2, 633--645 (2021; Zbl 1458.05192) Full Text: DOI
Doan, Trung Duy; Schiermeyer, Ingo Conflict-free vertex connection number at most 3 and size of graphs. (English) Zbl 1458.05062 Discuss. Math., Graph Theory 41, No. 2, 617-632 (2021). MSC: 05C15 05C40 05C07 05C12 PDFBibTeX XMLCite \textit{T. D. Doan} and \textit{I. Schiermeyer}, Discuss. Math., Graph Theory 41, No. 2, 617--632 (2021; Zbl 1458.05062) Full Text: DOI
Das, Angsuman Triameter of graphs. (English) Zbl 1458.05052 Discuss. Math., Graph Theory 41, No. 2, 601-616 (2021). MSC: 05C12 05C69 05C40 PDFBibTeX XMLCite \textit{A. Das}, Discuss. Math., Graph Theory 41, No. 2, 601--616 (2021; Zbl 1458.05052) Full Text: DOI arXiv
Zubrilina, Nina Asymptotic behavior of the edge metric dimension of the random graph. (English) Zbl 1460.05177 Discuss. Math., Graph Theory 41, No. 2, 589-599 (2021). Reviewer: Sandi Klavžar (Ljubljana) MSC: 05C80 05C12 PDFBibTeX XMLCite \textit{N. Zubrilina}, Discuss. Math., Graph Theory 41, No. 2, 589--599 (2021; Zbl 1460.05177) Full Text: DOI
Wu, Jichang; Broersma, Hajo; Mao, Yaping; Ma, Qin Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph. (English) Zbl 1458.05129 Discuss. Math., Graph Theory 41, No. 2, 559-587 (2021). MSC: 05C40 05C38 05C75 PDFBibTeX XMLCite \textit{J. Wu} et al., Discuss. Math., Graph Theory 41, No. 2, 559--587 (2021; Zbl 1458.05129) Full Text: DOI
Niu, Bei; Zhang, Xin On \((p, 1)\)-total labelling of some 1-planar graphs. (English) Zbl 1458.05231 Discuss. Math., Graph Theory 41, No. 2, 531-558 (2021). MSC: 05C78 05C10 05C15 PDFBibTeX XMLCite \textit{B. Niu} and \textit{X. Zhang}, Discuss. Math., Graph Theory 41, No. 2, 531--558 (2021; Zbl 1458.05231) Full Text: DOI
Li, Hengzhe; Ma, Yingbin; Li, Xueliang The vertex-rainbow connection number of some graph operations. (English) Zbl 1458.05077 Discuss. Math., Graph Theory 41, No. 2, 513-530 (2021). MSC: 05C15 05C40 05C76 PDFBibTeX XMLCite \textit{H. Li} et al., Discuss. Math., Graph Theory 41, No. 2, 513--530 (2021; Zbl 1458.05077) Full Text: DOI
Máčajová, Edita; Škoviera, Martin Critical and flow-critical snarks coincide. (English) Zbl 1458.05096 Discuss. Math., Graph Theory 41, No. 2, 503-511 (2021). MSC: 05C21 05C15 PDFBibTeX XMLCite \textit{E. Máčajová} and \textit{M. Škoviera}, Discuss. Math., Graph Theory 41, No. 2, 503--511 (2021; Zbl 1458.05096) Full Text: DOI arXiv
Lewchalermvongs, Chanun; Ananchuen, Nawarat Internally 4-connected graphs with no \(\{\text{cube}, V_8\}\)-minor. (English) Zbl 1458.05242 Discuss. Math., Graph Theory 41, No. 2, 481-501 (2021). MSC: 05C83 PDFBibTeX XMLCite \textit{C. Lewchalermvongs} and \textit{N. Ananchuen}, Discuss. Math., Graph Theory 41, No. 2, 481--501 (2021; Zbl 1458.05242) Full Text: DOI
Jiang, Hui; Li, Wenjing; Li, Xueliang; Magnant, Colton On proper (strong) rainbow connection of graphs. (English) Zbl 1459.05080 Discuss. Math., Graph Theory 41, No. 2, 469-479 (2021). Reviewer: Vahan Mkrtchyan (L’Aquila) MSC: 05C15 05C75 05C38 05C76 PDFBibTeX XMLCite \textit{H. Jiang} et al., Discuss. Math., Graph Theory 41, No. 2, 469--479 (2021; Zbl 1459.05080) Full Text: DOI
Shyu, Tay-Woei Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each. (English) Zbl 1458.05220 Discuss. Math., Graph Theory 41, No. 2, 451-468 (2021). MSC: 05C70 05C38 05C51 PDFBibTeX XMLCite \textit{T.-W. Shyu}, Discuss. Math., Graph Theory 41, No. 2, 451--468 (2021; Zbl 1458.05220) Full Text: DOI
Janczewski, Robert; Trzaskowska, Anna Maria; Turowski, Krzysztof \(T\)-colorings, divisibility and the circular chromatic number. (English) Zbl 07308491 Discuss. Math., Graph Theory 41, No. 2, 441-450 (2021). MSC: 05C15 PDFBibTeX XMLCite \textit{R. Janczewski} et al., Discuss. Math., Graph Theory 41, No. 2, 441--450 (2021; Zbl 07308491) Full Text: DOI
Zhu, Enqiang; Shao, Zehui On the star chromatic index of generalized Petersen graphs. (English) Zbl 1459.05096 Discuss. Math., Graph Theory 41, No. 2, 427-439 (2021). Reviewer: Iztok Peterin (Maribor) MSC: 05C15 05C75 PDFBibTeX XMLCite \textit{E. Zhu} and \textit{Z. Shao}, Discuss. Math., Graph Theory 41, No. 2, 427--439 (2021; Zbl 1459.05096) Full Text: DOI
Sun, Yuefang; Sheng, Bin; Jin, Zemin The minimum size of a graph with given tree connectivity. (English) Zbl 1459.05045 Discuss. Math., Graph Theory 41, No. 2, 409-425 (2021). Reviewer: László A. Székely (Columbia) MSC: 05C05 05C35 05C40 05C70 PDFBibTeX XMLCite \textit{Y. Sun} et al., Discuss. Math., Graph Theory 41, No. 2, 409--425 (2021; Zbl 1459.05045) Full Text: DOI
Campero-Alonzo, José Manuel; Sánchez-López, Rocío \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs. (English) Zbl 1458.05088 Discuss. Math., Graph Theory 41, No. 2, 391-408 (2021). MSC: 05C20 05C38 05C69 PDFBibTeX XMLCite \textit{J. M. Campero-Alonzo} and \textit{R. Sánchez-López}, Discuss. Math., Graph Theory 41, No. 2, 391--408 (2021; Zbl 1458.05088) Full Text: DOI
Jayawardene, Chula J.; Narváez, David; Radziszowski, Stanisław Star-critical Ramsey numbers for cycles versus \(K_4\). (English) Zbl 1458.05163 Discuss. Math., Graph Theory 41, No. 2, 381-390 (2021). MSC: 05C55 05D10 05C38 PDFBibTeX XMLCite \textit{C. J. Jayawardene} et al., Discuss. Math., Graph Theory 41, No. 2, 381--390 (2021; Zbl 1458.05163) Full Text: DOI
Samodivkin, Vladimir Changing and unchanging of the domination number of a graph: path addition numbers. (English) Zbl 1459.05247 Discuss. Math., Graph Theory 41, No. 2, 365-379 (2021). Reviewer: Iztok Peterin (Maribor) MSC: 05C69 05C38 05C12 PDFBibTeX XMLCite \textit{V. Samodivkin}, Discuss. Math., Graph Theory 41, No. 2, 365--379 (2021; Zbl 1459.05247) Full Text: DOI arXiv
Ahangar, H. Abdollahzadeh; Amjadi, J.; Chellali, M.; Nazari-Moghaddam, S.; Sheikholeslami, S. M. Total 2-rainbow domination numbers of trees. (English) Zbl 1460.05139 Discuss. Math., Graph Theory 41, No. 2, 345-360 (2021). Reviewer: Sandi Klavžar (Ljubljana) MSC: 05C69 PDFBibTeX XMLCite \textit{H. A. Ahangar} et al., Discuss. Math., Graph Theory 41, No. 2, 345--360 (2021; Zbl 1460.05139) Full Text: DOI