Partitioning planar graphs without 4-cycles and 6-cycles into a forest and a disjoint union of paths

arXiv2203.06466MaRDI QIDQ6393533

Kittikorn Nakprasit, Pongpat Sittitrai

Publication date: 12 March 2022

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Partitioning planar graphs without 4-cycles and 6-cycles into a forest and a disjoint union of paths