On edge colorings of 1-planar graphs without 5-cycles with two chords

DOI10.7151/dmgt.2072zbMath1409.05091OpenAlexW2797634318WikidataQ129987955 ScholiaQ129987955MaRDI QIDQ1717181

Lin Sun, Jian Liang Wu

Publication date: 7 February 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2072

zbMATH Keywords

cycleedge-coloringchorddischarging method1-planar graphVizing's adjacency lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge colorings of planar graphs without 5-cycles with two chords
• On edge colorings of 1-planar graphs without adjacent triangles
• On the chromatic index of almost all graphs
• Planar graphs of maximum degree seven are Class I
• On edge colorings of \(1\)-planar graphs
• Ein Sechsfarbenproblem auf der Kugel
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• The size of edge chromatic critical graphs with maximum degree 6
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: On edge colorings of 1-planar graphs without 5-cycles with two chords