The edge chromatic number of outer-1-planar graphs
From MaRDI portal
(Redirected from Publication:906489)
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.
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.
Cites work
- Edge covering pseudo-outerplanar graphs with forests
- Every outer-1-plane graph has a right angle crossing drawing
- scientific article; zbMATH DE number 3924797 (Why is no real title available?)
- scientific article; zbMATH DE number 1559126 (Why is no real title available?)
- scientific article; zbMATH DE number 6424528 (Why is no real title available?)
- List edge-colorings of series-parallel graphs
- List total coloring of pseudo-outerplanar graphs
- On edge colorings of \(1\)-planar graphs
- Recognizing outer 1-planar graphs in linear time
- The NP-Completeness of Edge-Coloring
Cited in
(7)- Graph edge coloring: a survey
- List edge coloring of outer-1-planar graphs
- Total coloring of outer-1-planar graphs: the cold case
- scientific article; zbMATH DE number 6870674 (Why is no real title available?)
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs
- Conflict-free incidence coloring of outer-1-planar graphs
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)
