A result on linear arboricity of planar graphs.

zbMATH Open1349.05060MaRDI QIDQ2804855FDOQ2804855

Authors: Zhao Yang Luo 

Publication date: 4 May 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• The linear arboricity of planar graphs without 5-cycles with chords
• The linear arboricity of planar graphs without 5-cycles with two chords
• The linear arboricity of planar graphs without chordal short cycles
• The linear arboricity of planar graphs with maximum degree at least 7
• 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) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (9)

• The linear arboricity of planar graphs without chordal short cycles
• Some results on linear arboricity
• Title not available (Why is that?)
• The linear arboricity of planar graphs with maximum degree at least five
• The linear arboricity of planar graphs with maximum degree at least 7
• A planar linear arboricity conjecture
• On the linear vertex-arboricity of a planar graph
• 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: A result on linear arboricity of planar graphs.

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