Cho, Eun-Kyung; Choi, Ilkyoo; Park, Boram Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests. (English) Zbl 1455.05059 Discrete Math. 344, No. 1, Article ID 112172, 9 p. (2021). MSC: 05C70 05C10 PDF BibTeX XML Cite \textit{E.-K. Cho} et al., Discrete Math. 344, No. 1, Article ID 112172, 9 p. (2021; Zbl 1455.05059) Full Text: DOI
Choi, Ilkyoo; Dross, François; Ochem, Pascal Partitioning sparse graphs into an independent set and a graph with bounded size components. (English) Zbl 1441.05179 Discrete Math. 343, No. 8, Article ID 111921, 16 p. (2020). MSC: 05C70 05C42 05C69 05C10 PDF BibTeX XML Cite \textit{I. Choi} et al., Discrete Math. 343, No. 8, Article ID 111921, 16 p. (2020; Zbl 1441.05179) Full Text: DOI
Liu, Jie; Lv, Jian-Bo Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable. (English) Zbl 1437.05077 Bull. Malays. Math. Sci. Soc. (2) 43, No. 3, 2493-2507 (2020). MSC: 05C15 05C10 05C38 PDF BibTeX XML Cite \textit{J. Liu} and \textit{J.-B. Lv}, Bull. Malays. Math. Sci. Soc. (2) 43, No. 3, 2493--2507 (2020; Zbl 1437.05077) Full Text: DOI
Kang, Dong Yeap; Kim, Jaehoon On 1-factors with prescribed lengths in tournaments. (English) Zbl 1430.05048 J. Comb. Theory, Ser. B 141, 31-71 (2020). MSC: 05C20 05C38 05C70 PDF BibTeX XML Cite \textit{D. Y. Kang} and \textit{J. Kim}, J. Comb. Theory, Ser. B 141, 31--71 (2020; Zbl 1430.05048) Full Text: DOI arXiv
Kang, Dong Yeap Sparse highly connected spanning subgraphs in dense directed graphs. (English) Zbl 07186350 Comb. Probab. Comput. 28, No. 3, 423-464 (2019). MSC: 05C20 05C40 PDF BibTeX XML Cite \textit{D. Y. Kang}, Comb. Probab. Comput. 28, No. 3, 423--464 (2019; Zbl 07186350) Full Text: DOI
Choi, Ilkyoo; Yu, Gexin; Zhang, Xia Planar graphs with girth at least 5 are \((3, 4)\)-colorable. (English) Zbl 1422.05035 Discrete Math. 342, No. 12, Article ID 111577, 12 p. (2019). MSC: 05C10 05C15 PDF BibTeX XML Cite \textit{I. Choi} et al., Discrete Math. 342, No. 12, Article ID 111577, 12 p. (2019; Zbl 1422.05035) Full Text: DOI arXiv
Bang-Jensen, Jørgen; Havet, Frédéric Tournaments and semicomplete digraphs. (English) Zbl 1407.05102 Bang-Jensen, Jørgen (ed.) et al., Classes of directed graphs. Cham: Springer. Springer Monogr. Math., 35-124 (2018). MSC: 05C20 05-02 PDF BibTeX XML Cite \textit{J. Bang-Jensen} and \textit{F. Havet}, in: Classes of directed graphs. Cham: Springer. 35--124 (2018; Zbl 1407.05102) Full Text: DOI
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne Maximum matching width: new characterizations and a fast algorithm for dominating set. (English) Zbl 1395.05116 Discrete Appl. Math. 248, 114-124 (2018). MSC: 05C62 05C85 05C69 68Q25 PDF BibTeX XML Cite \textit{J. Jeong} et al., Discrete Appl. Math. 248, 114--124 (2018; Zbl 1395.05116) Full Text: DOI
Sittitrai, Pongpat; Nakprasit, Kittikorn Defective 2-colorings of planar graphs without 4-cycles and 5-cycles. (English) Zbl 1388.05072 Discrete Math. 341, No. 8, 2142-2150 (2018). MSC: 05C15 05C10 05C38 68Q25 PDF BibTeX XML Cite \textit{P. Sittitrai} and \textit{K. Nakprasit}, Discrete Math. 341, No. 8, 2142--2150 (2018; Zbl 1388.05072) Full Text: DOI arXiv
Choi, Ilkyoo; Liu, Chun-Hung; Oum, Sang-il Characterization of cycle obstruction sets for improper coloring planar graphs. (English) Zbl 1388.05061 SIAM J. Discrete Math. 32, No. 2, 1209-1228 (2018). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{I. Choi} et al., SIAM J. Discrete Math. 32, No. 2, 1209--1228 (2018; Zbl 1388.05061) Full Text: DOI arXiv