The structure of plane graphs with independent crossings and its applications to coloring problems
- 122 Downloads
If a graph G has a drawing in the plane in such a way that every two crossings are independent, then we call G a plane graph with independent crossings or IC-planar graph for short. In this paper, the structure of IC-planar graphs with minimum degree at least two or three is studied. By applying their structural results, we prove that the edge chromatic number of G is Δ if Δ ≥ 8, the list edge (resp. list total) chromatic number of G is Δ (resp. Δ + 1) if Δ ≥ 14 and the linear arboricity of G is ℈Δ/2⌊ if Δ ≥ 17, where G is an IC-planar graph and Δ is the maximum degree of G.
KeywordsIndependent crossing IC-planar graph Light edge Coloring Discharging
Unable to display preview. Download preview PDF.
- Jensen T.R., Toft B., Graph Coloring Problems, Wiley-Intersci. Ser. Discrete Math. Optim., John Wiley & Sons, New York, 1995Google Scholar
- Zhang X., Hou J., Liu G., On total colorings of 1-planar graphs, preprint available at http://xinzhang.hpage.com/get_file.php?id=1513981&vnr=342077
- Zhang X., Wu J., Liu G., List edge and list total coloring of 1-planar graphs, Front. Math. China (in press), DOI: 10.1007/s11464-012-0184-7Google Scholar