Equitable coloring planar graphs with large girth
From MaRDI portal
Recommendations
Cites work
- A list analogue of equitable coloring
- Equitable and proportional coloring of trees
- Equitable Coloring
- Equitable coloring and the maximum degree
- Equitable coloring of trees
- Equitable colorings of outerplanar graphs
- Graph Colorings
- Graph theory
- scientific article; zbMATH DE number 1302199 (Why is no real title available?)
- scientific article; zbMATH DE number 1308943 (Why is no real title available?)
- scientific article; zbMATH DE number 1046311 (Why is no real title available?)
- scientific article; zbMATH DE number 2079370 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- On Equitable Coloring of d-Degenerate Graphs
- On equitable coloring of bipartite graphs
Cited in
(12)- Equitable coloring and equitable choosability of graphs with small maximum average degree
- Relaxed equitable colorings of planar graphs with girth at least 8
- On the equitable edge-coloring of 1-planar graphs and planar graphs
- Equitable coloring of sparse planar graphs
- Equitable and list equitable colorings of planar graphs without 4-cycles
- Equitable vertex arboricity of graphs
- Equitable cluster partition of planar graphs with girth at least 12
- Equitable list coloring of sparse graphs
- Equitable and list equitable colorings of planar graphs without 5-cycles
- The equitable non-split domination number of graphs
- Equitable cluster partition of graphs with small maximum average degree
- Equitable defective coloring of sparse planar graphs
This page was built for publication: Equitable coloring planar graphs with large girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2470470)