Equitable coloring in 1-planar graphs

DOI10.1016/j.disc.2024.114286MaRDI QIDQ6646408

Daniel W. Cranston, Reem Mahmoud

Publication date: 2 December 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphHajnal-Szemerédi1-planarequitable coloring conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On equitable colorings of sparse graphs
• An upper bound on the number of edges in an almost planar bipartite graph
• Equitable colorings of planar graphs with maximum degree at least nine
• On equitable \(\Delta\)-coloring of graphs with low average degree
• Equitable coloring and the maximum degree
• On equitable coloring of bipartite graphs
• Equitable Coloring
• Equitable Colourings of d-degenerate Graphs
• Equitable coloring of planar graphs with maximum degree at least eight

This page was built for publication: Equitable coloring in 1-planar graphs