Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
From MaRDI portal
Recommendations
Cites work
- Equitable Coloring
- Equitable colorings of planar graphs with maximum degree at least nine
- Equitable Colourings of d-degenerate Graphs
- Equitable d-degenerate Choosability of Graphs
- Equitable improper choosability of graphs
- Equitable list point arboricity of graphs
- Equitable list tree-coloring of bounded treewidth graphs
- Equitable list vertex colourability and arboricity of grids
- Equitable partition of graphs into induced forests
- Equitable partition of planar graphs
- Equitable vertex arboricity conjecture holds for graphs with low degeneracy
- Equitable vertex arboricity of graphs
- Equitable vertex arboricity of planar graphs
- Graph theory
- scientific article; zbMATH DE number 1308943 (Why is no real title available?)
- On Equitable Coloring of d-Degenerate Graphs
- Smallest-last ordering and clustering and graph coloring algorithms
- Theoretical aspects of equitable partition of networks into sparse modules
This page was built for publication: Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2072075)