The edge colorings of \(K_5\)-minor free graphs

DOI10.1016/j.disc.2021.112360OpenAlexW3133921810MaRDI QIDQ2022144

Jieru Feng, Yu-ping Gao, Jian Liang Wu

Publication date: 28 April 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.10109

zbMATH Keywords

edge coloringchromatic indextree-decomposition\( K_5\)-minor free graph

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

The total coloring of \(K_5\)-minor-free graphs

Cites Work

• Unnamed Item
• \(3n-5\) edges do force a subdivision of \(K_5\)
• Edge coloring of planar graphs without adjacent 7-cycles
• Edge-coloring critical graphs with high degree
• Planar graphs of maximum degree seven are Class I
• Über eine Eigenschaft der ebenen Komplexe
• The NP-Completeness of Some Edge-Partition Problems
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: The edge colorings of \(K_5\)-minor free graphs