The linear arboricity of planar graphs with 6-cycles containing at most one chord

DOI10.15960/J.CNKI.ISSN.1007-6093.2019.02.011MaRDI QIDQ5210347zbMATH OpenFDO

Authors Zhao Yang Luo, Lin Sun

Publication date 22 January 2020

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2019.02.011

zbMATH Keywords

cycledischarging methodlinear arboricityplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• The linear arboricity of planar graphs without 5-, 6-cycles with chords
• The linear arboricity of planar graphs without 5-cycles with chords
• The linear arboricity of planar graphs without 5-cycles with two chords
• A result on linear arboricity of planar graphs.
• The linear arboricity of planar graphs without chordal short cycles

Cited in

(7)

• The linear arboricity of planar graphs without 5-, 6-cycles with chords
• The linear arboricity of planar graphs without 5-cycles with chords
• A result on linear arboricity of planar graphs.
• Vertex arboricity of planar graphs without chordal 6-cycles
• The linear arboricity of planar graphs without chordal short cycles
• scientific article; zbMATH DE number 6453493 (Why is no real title available?)
• The linear arboricity of planar graphs without 5-cycles with two chords

This page was built for publication: The linear arboricity of planar graphs with 6-cycles containing at most one chord

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