Affiliation:
1. Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China
Abstract
An equitable k-coloring of a graph G is a proper vertex coloring such that the size of any two color classes differ at most 1. If there is an equitable k-coloring of G, then the graph G is said to be equitably k-colorable. A 1-planar graph is a graph that can be embedded in the Euclidean plane such that each edge can be crossed by other edges at most once. An IC-planar graph is a 1-planar graph with distinct end vertices of any two crossings. In this paper, we will prove that every IC-planar graph with girth g≥7 is equitably Δ(G)-colorable, where Δ(G) is the maximum degree of G.
Funder
National Natural Science Foundation of China
Subject
Geometry and Topology,Logic,Mathematical Physics,Algebra and Number Theory,Analysis
Reference28 articles.
1. Bondy, J.A., and Murty, U.S.R. (1976). Graph Theory with Applications, North-Holland.
2. New global optima results for the Kauffman NK model: Handling dependency;Kaul;Math. Program.,2006
3. De Werra, D. (1975). Combinatorial Programming: Methods and Applications, Proceedings of the NATO Advanced Study Institute, Versailles, France, 2–13 September 1974, Springer.
4. Equitable partition of graphs into independent sets and cliques;Monteiro;Math. Contemp.,2022
5. Equitable partition of graphs into induced linear forests;Zhang;J. Comb. Optim.,2020