(F₁, F)-partition of plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles

DOI10.1016/J.DAM.2025.08.017MaRDI QIDQ6885602zbMATH OpenFDO

Authors Xianan Jin, Tianlong Ma, Weiling Yang, Gang Zhang

Publication date 11 December 2025

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

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

zbMATH Keywords

\((\mathcal{F}_1\mathcal{F})\)-partitionimproper coloringplane graphsshort cycles

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
• A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles
• A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
• An (F1,F4)‐partition of graphs with low genus and girth at least 6
• An \((\mathcal{F}_3, \mathcal{F}_4)\)-partition of planar graphs without 4- and 6-cycles
• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
• Decomposing a planar graph of girth 5 into an independent set and a forest
• Decomposing a triangle-free planar graph into a forest and a subcubic forest
• Every planar map is four colorable
• scientific article; zbMATH DE number 3661375 (Why is no real title available?)
• scientific article; zbMATH DE number 1882351 (Why is no real title available?)
• I,F-partitions of sparse graphs
• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
• Planar graphs without 4, 6, 8-cycles are 3-colorable
• Planar graphs without 4-cycles and intersecting triangles are ( 1 , 1 , 0 )-colorable
• Planar graphs without cycles of length from 4 to 6 are (1,0,0)-colorable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Planar graphs without normally adjacent short cycles
• Planar graphs without short even cycles are near-bipartite
• Plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles are 3-colorable
• Sparse graphs are near-bipartite
• Steinberg's conjecture is false
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles

This page was built for publication: \((\mathcal{F}_1, \mathcal{F})\)-partition of plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles

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