Edge covering pseudo-outerplanar graphs with forests

DOI10.1016/j.disc.2012.05.017zbMath1248.05053arXiv1108.3877OpenAlexW2964301131MaRDI QIDQ449118

Xin Zhang, Gui Zhen Liu, Jian Liang Wu

Publication date: 12 September 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.3877

zbMATH Keywords

linear arboricityedge decompositionedge chromatic numberpseudo-outerplanar graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items

Hamiltonicity and generalised total colourings of planar graphs, Edge covering problem under hybrid uncertain environments, An annotated bibliography on 1-planarity, Total coloring of outer-1-planar graphs with near-independent crossings, List total coloring of pseudo-outerplanar graphs, The edge chromatic number of outer-1-planar graphs, Light paths and edges in families of outer-1-planar graphs, List edge coloring of outer-1-planar graphs, Linear arboricity of outer-1-planar graphs, Total coloring of outer-1-planar graphs: the cold case, The structure and the list 3-dynamic coloring of outer-1-planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge and total choosability of near-outerplanar graphs
• Covering planar graphs with forests, one having bounded maximum degree
• Parallel concepts in graph theory
• The linear arboricity of series-parallel graphs
• Covering planar graphs with forests
• List edge-colorings of series-parallel graphs
• Planar graphs of maximum degree seven are Class I
• Ein Sechsfarbenproblem auf der Kugel
• A Planar linear arboricity conjecture
• The linear arboricity of planar graphs of maximum degree seven is four
• COVERING AND PACKING IN GRAPHS, I.