Edge coloring of 1-planar graphs without intersecting triangles and chordal 5-cycles.

zbMATH Open1463.05170MaRDI QIDQ3134305FDOQ3134305

Authors Jing Jin, Baogang Xu

Publication date 9 February 2018

zbMATH Keywords

trianglesedge coloring\(1\)-planar graphschordal \(5\)-cycles

Mathematics Subject Classification ID

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

Recommendations

• On edge colorings of 1-planar graphs without 5-cycles with two chords
• On edge colorings of 1-planar graphs without chordal 5-cycles.
• On edge colorings of 1-planar graphs without adjacent triangles
• On edge colorings of 1-planar graphs with 6-cycles having at most three chords
• On edge colorings of \(1\)-planar graphs

Cited in

(10)

• A sufficient condition for an IC-planar graph to be of class 1
• On edge colorings of 1-planar graphs without chordal 5-cycles.
• Graph edge coloring: a survey
• Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable.
• The edge chromatic number of outer-1-planar graphs
• On edge colorings of 1-planar graphs without 5-cycles with two chords
• On edge colorings of 1-planar graphs without adjacent triangles
• On partitioning the edges of 1-plane graphs
• On edge colorings of 1-planar graphs with 6-cycles having at most three chords
• On edge colorings of \(1\)-planar graphs

This page was built for publication: Edge coloring of \(1\)-planar graphs without intersecting triangles and chordal \(5\)-cycles.

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