The linear arboricity of planar graphs without chordal short cycles

zbMATH Open1264.05109MaRDI QIDQ2895418FDOQ2895418

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

Publication date: 2 July 2012

Published in: Utilitas Mathematica (Search for Journal in Brave)

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

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)

Cited In (10)

• Minimum number of disjoint linear forests covering a planar graph
• The linear arboricity of planar graphs with no short cycles
• Title not available (Why is that?)
• 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
• The linear 2-arboricity of planar graphs without 5-, 6-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)