The edge chromatic number of outer-1-planar graphs

DOI10.1016/J.DISC.2015.12.009zbMATH Open1329.05122arXiv1405.3183OpenAlexW1833754949MaRDI QIDQ906489FDOQ906489

Authors: Xin Zhang 

Publication date: 21 January 2016

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

Abstract: A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once. In this paper, we completely determine the edge chromatic number of outer 1-planar graphs.

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

Recommendations

• List edge coloring of outer-1-planar graphs
• Edge coloring of \(1\)-planar graphs without intersecting triangles and chordal \(5\)-cycles.
• On edge colorings of 1-planar graphs without 5-cycles with two chords
• On edge colorings of 1-planar graphs without adjacent triangles
• On edge colorings of 1-planar graphs without chordal 5-cycles.

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)

Cites Work

• The NP-Completeness of Edge-Coloring
• Title not available (Why is that?)
• Edge covering pseudo-outerplanar graphs with forests
• Recognizing Outer 1-Planar Graphs in Linear Time
• Every outer-1-plane graph has a right angle crossing drawing
• List edge-colorings of series-parallel graphs
• On edge colorings of \(1\)-planar graphs
• List total coloring of pseudo-outerplanar graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• The structure and the list 3-dynamic coloring of outer-1-planar graphs
• Title not available (Why is that?)
• Total coloring of outer-1-planar graphs: the cold case
• List edge coloring of outer-1-planar graphs
• Conflict-free incidence coloring of outer-1-planar graphs
• On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs
• Graph edge coloring: a survey

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

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