The edge chromatic number of outer-1-planar graphs

DOI10.1016/j.disc.2015.12.009zbMath1329.05122arXiv1405.3183OpenAlexW1833754949MaRDI QIDQ906489

Xin Zhang

Publication date: 21 January 2016

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

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

zbMATH Keywords

edge coloringpseudo-outerplanar graphouter-1-planar graph

Mathematics Subject Classification ID

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

Related Items (5)

On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs ⋮ Graph edge coloring: a survey ⋮ List edge coloring 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
• List total coloring of pseudo-outerplanar graphs
• Edge covering pseudo-outerplanar graphs with forests
• List edge-colorings of series-parallel graphs
• On edge colorings of \(1\)-planar graphs
• Recognizing Outer 1-Planar Graphs in Linear Time
• The NP-Completeness of Edge-Coloring
• EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING

This page was built for publication: The edge chromatic number of outer-1-planar graphs