Edge Coloring of Triangle-Free 1-Planar Graphs

preprint2010arXivOpen access

it is shown that each triangle-free 1-planar graph with maximum degree $Δ\geq7$ can be $Δ$ -colorable by Discharging Method.

Explore this paper’s authors, topics and related work.

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Abstract