Edge Coloring of Triangle-Free 1-Planar Graphs
Abstract
it is shown that each triangle-free 1-planar graph with maximum degree ≥7 can be -colorable by Discharging Method.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.