On edge colorings of 1-planar graphs with 6-cycles having at most three chords

MaRDI QIDQ3453972zbMATH OpenFDO

Authors Lin Sun, Hua Cai, Zhao Yang Luo, Jian-Liang Wu

Publication date 2 December 2015

Full work available at URL http://www.ceser.in/ceserp/index.php/ijamas/article/view/3378

zbMATH Keywords

1-planar graphsdischarging methodedge coloring

Mathematics Subject Classification ID

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
• Edge coloring of 1-planar graphs without intersecting triangles and chordal 5-cycles.
• Some sufficient conditions for 1-planar graphs to be class 1

Cited in

(5)

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

This page was built for publication: On edge colorings of 1-planar graphs with 6-cycles having at most three chords

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