Planar graphs without 5^--cycles at distance less than 3 are (I, F)-colorable

DOI10.1016/J.DAM.2026.08.004MaRDI QIDQ7353746zbMATH OpenFDO

Authors Zhen He, Tao Wang, Xiaojing Yang

Publication date 18 September 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2026.08.004

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• (I,F)-partition of planar graphs without cycles of length 4, 6, or 9
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Decomposing a planar graph of girth 5 into an independent set and a forest
• scientific article; zbMATH DE number 1882351 (Why is no real title available?)
• On DP-coloring of graphs and multigraphs
• On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree
• Partitioning sparse graphs into an independent set and a forest of bounded degree
• Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
• Planar graphs without normally adjacent short cycles
• Planar graphs without short even cycles are near-bipartite
• Sparse graphs are near-bipartite

This page was built for publication: Planar graphs without \(5^-\)-cycles at distance less than 3 are \((\mathcal{I}, \mathcal{F})\)-colorable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7353746)