On equitable colorings of sparse graphs
From MaRDI portal
Publication:726517
DOI10.1007/S40840-015-0291-1zbMATH Open1339.05150OpenAlexW2295952825MaRDI QIDQ726517FDOQ726517
Authors: Xin Zhang
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
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- An Ore-type theorem on equitable coloring
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Title not available (Why is that?)
- Graph theory with applications
- Total coloring of planar graphs without some chordal 6-cycles
- Ein Sechsfarbenproblem auf der Kugel
- The structure of 1-planar graphs
- Equitable coloring and the maximum degree
- On equitable coloring of bipartite graphs
- Equitable \(\Delta\)-coloring of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equitable Coloring
- On equitable and equitable list colorings of series-parallel graphs
- Equitable colorings of planar graphs with maximum degree at least nine
- Total colorings of planar graphs with small maximum degree
- Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
- Equitable Colourings of d-degenerate Graphs
- On equitable \(\Delta\)-coloring of graphs with low average degree
- On Equitable Coloring of d-Degenerate Graphs
- The linear arboricity of planar graphs without 5-cycles with chords
- Title not available (Why is that?)
Cited In (11)
- Equitable colorings of \(K_4\)-minor-free graphs
- On equitable \(\Delta\)-coloring of graphs with low average degree
- Equitable and \(m\)-bounded coloring of split graphs
- Sperner's Colorings, Hypergraph Labeling Problems and Fair Division
- Equitable coloring of three classes of 1-planar graphs
- Equitable orientations of sparse uniform hypergraphs
- Equitable coloring in 1-planar graphs
- Equitable coloring of 2-degenerate graph and plane graphs without cycles of specific lengths
- Equitable coloring of sparse planar graphs
- Equivalence of two conjectures on equitable coloring of graphs
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
This page was built for publication: On equitable colorings of sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726517)