The linear arboricity of planar graphs without chordal short cycles

MaRDI QIDQ2895418zbMATH OpenFDO

Authors Bin Liu, Jian-Liang Wu, Hui-Juan Wang

Publication date 2 July 2012

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

cycleplanar graphlinear arboricity

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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 with 6-cycles containing at most one chord

Cited in

(10)

• The linear 2-arboricity of planar graphs without 5-, 6-cycles with chords
• Minimum number of disjoint linear forests covering a planar graph
• The linear arboricity of planar graphs with no 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
• A result on linear arboricity of planar graphs.
• The linear arboricity of planar graphs with 6-cycles containing at most one chord
• The linear arboricity of \(K_5\)-minor free graphs
• The linear arboricity of planar graphs without 5-, 6-cycles with chords
• The linear arboricity of planar graphs without 5-cycles with chords

This page was built for publication: The linear arboricity of planar graphs without chordal short cycles

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