Strong arboricity of graphs

DOI10.1007/S00373-025-02934-5MaRDI QIDQ6942802zbMATH OpenFDO

Authors Tomasz Bartnicki, Sebastian Czerwiński, Jarosław Grytczuk, Zofia Miechowicz

Publication date 18 August 2025

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00373-025-02934-5

zbMATH Keywords

acyclic chromatic numberbroken cyclesstrong arboricitywoody edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites work

• A logical expansion in mathematics.
• Acyclic edge colorings of graphs
• Algebraic Graph Theory
• An inductive proof of Whitney's Broken Circuit Theorem
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
• Coloring with no 2-colored \(P_4\)'s
• Colouring edges with many colours in cycles
• Edge-coloring of plane multigraphs with many colors on facial cycles
• Edge-Disjoint Spanning Trees of Finite Graphs
• Facially-constrained colorings of plane graphs: a survey
• Generalized arboricity of graphs with large girth
• scientific article; zbMATH DE number 4077268 (Why is no real title available?)
• scientific article; zbMATH DE number 3603300 (Why is no real title available?)
• On acyclic colorings of planar graphs
• Partitioning into graphs with only small components
• Sparsity. Graphs, structures, and algorithms
• Star coloring of sparse graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5

This page was built for publication: Strong arboricity of graphs

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