Equitable Coloring of Three Classes of 1-planar Graphs
- 50 Downloads
A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. A plane graph with near-independent crossings or independent crossings, say NIC-planar graph or IC-planar graph, is a 1-planar graph with the restriction that for any two crossings the four crossed edges are incident with at most one common vertex or no common vertices, respectively. In this paper, we prove that each 1-planar graph, NIC-planar graph or IC-planar graph with maximum degree Δ at least 15, 13 or 12 has an equitable Δ-coloring, respectively. This verifies the well-known Chen-Lih-Wu Conjecture for three classes of 1-planar graphs and improves some known results.
Keywords1-planar graph equitable coloring independent crossing
2000 MR Subject Classification05C15 05C10
Unable to display preview. Download preview PDF.
- Chen, B.L., Lih, K.W., Yan, J.H. A note on equitable coloring of interval graphs. Manuscript, 1998Google Scholar
- Hajnal, A., Szemerédi, E. Proof of a conjecture of P. Erdős. In: Combinatorial Theory and its Applications, P. Erdős, A. Rényi and V. T. Sós, eds, North-Holand, London, 1970, 601–623Google Scholar
- Yap, H.P., Zhang, Y. The equitable Δ-coloring coniecture holds for outerplanar graphs. Bull. Inst. Math. Acad. Sin.(N.S.), 25: 143–149 (1997)Google Scholar