The linear arboricity of planar graphs with maximum degree at least five

zbMATH Open1233.05108MaRDI QIDQ648443FDOQ648443

Authors: Xiang Tan, Hongyu Chen, Jian-Liang Wu 

Publication date: 22 November 2011

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: http://math.usm.my/bulletin/html/vol34_3_12.html

Recommendations

• The linear arboricity of planar graphs without 5-cycles and 6-cycles.
• The linear arboricity of planar graphs with maximum degree at least 7
• The linear arboricity of planar graphs without adjacent 4-cycles
• The linear arboricity of planar graphs without 5-cycles with chords
• A result on linear arboricity of planar graphs.

zbMATH Keywords

cycleplanar graphlinear arboricity

Mathematics Subject Classification ID

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

Cited In (6)

• The linear arboricity of planar graphs without adjacent 4-cycles
• The linear arboricity of planar graphs with maximum degree at least 5
• The linear arboricity of planar graphs with maximum degree at least 7
• The linear arboricity of planar graphs without 5-cycles and 6-cycles.
• The linear arboricity of planar graphs of maximum degree seven is four
• The linear arboricity of \(K_5\)-minor free graphs

This page was built for publication: The linear arboricity of planar graphs with maximum degree at least five

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