On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles

DOI10.1080/00207160.2016.1158813zbMath1367.05083OpenAlexW2327426418MaRDI QIDQ4976301

Yi Qiao Wang

Publication date: 28 July 2017

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2016.1158813

zbMATH Keywords

cycleplanar graphmaximum degreelinear 2-arboricity

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On linear 2-arboricity of certain graphs

Cites Work

• On linear k-arboricity
• Planar graphs without 5-cycles or without 6-cycles
• Some problems about linear arboricity
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
• On the linear \(k\)-arboricity of cubic graphs
• Linear \(k\)-arboricities on trees
• On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
• Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles
• THE LINEAR 2-ARBORICITY OF PLANAR GRAPHS WITHOUT ADJACENT SHORT CYCLES

This page was built for publication: On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles