On equitable colorings of sparse graphs
From MaRDI portal
Publication:726517
DOI10.1007/s40840-015-0291-1zbMath1339.05150OpenAlexW2295952825MaRDI QIDQ726517
Publication date: 11 July 2016
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-015-0291-1
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total colorings of planar graphs with small maximum degree
- Equitable \(\Delta\)-coloring of graphs
- On equitable and equitable list colorings of series-parallel graphs
- Equitable colorings of planar graphs with maximum degree at least nine
- On equitable \(\Delta\)-coloring of graphs with low average degree
- The structure of 1-planar graphs
- Equitable coloring and the maximum degree
- On equitable coloring of bipartite graphs
- Total coloring of planar graphs without some chordal 6-cycles
- The linear arboricity of planar graphs without 5-cycles with chords
- Ein Sechsfarbenproblem auf der Kugel
- An Ore-type theorem on equitable coloring
- Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Equitable Coloring
- Equitable Colourings of d-degenerate Graphs
- On Equitable Coloring of d-Degenerate Graphs
This page was built for publication: On equitable colorings of sparse graphs
