On the equitable edge-coloring of 1-planar graphs and planar graphs

DOI10.1007/s00373-017-1786-3zbMath1371.05086OpenAlexW2619231719MaRDI QIDQ2409529

Donglei Yang, Xin Zhang, Dai-Qiang Hu, Jian Liang Wu

Publication date: 11 October 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1786-3

zbMATH Keywords

\(k\)-edge coloring

Mathematics Subject Classification ID

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

Related Items (1)

A structure of 1-planar graph and its applications to coloring problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• List edge and list total coloring of 1-planar graphs
• A sufficient condition for equitable edge-colourings of simple graphs
• List edge and list total colourings of multigraphs
• Planar graphs of maximum degree seven are Class I
• On edge colorings of \(1\)-planar graphs
• Ein Sechsfarbenproblem auf der Kugel
• Equitable edge-colorings of simple graphs
• The Solution of a Timetabling Problem
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: On the equitable edge-coloring of 1-planar graphs and planar graphs