Theoretical aspects of equitable partition of networks into sparse modules
From MaRDI portal
Publication:2031046
DOI10.1016/j.tcs.2021.04.010zbMath1482.05322OpenAlexW3154609639MaRDI QIDQ2031046
Publication date: 8 June 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.04.010
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
On Equitable List Arboricity of Graphs ⋮ Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equitable vertex arboricity of subcubic graphs
- Equitable vertex arboricity of graphs
- An optimal greedy heuristic to color interval graphs
- Equitable coloring and the maximum degree
- Equitable partition of planar graphs
- Complexity of tree-coloring interval graphs equitably
- Equitable improper choosability of graphs
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs
- Equitable list tree-coloring of bounded treewidth graphs
- Equitable vertex arboricity conjecture holds for graphs with low degeneracy
- Tree-coloring problems of bounded treewidth graphs
- Equitable partition of graphs into induced linear forests
- Equitable partition of plane graphs with independent crossings into induced forests
- Equitable partition of graphs into induced forests
- Equitable vertex arboricity of 5-degenerate graphs
- Graph Theory
- A conjecture on equitable vertex arboricity of graphs
- A list analogue of equitable coloring
- Equitable d-degenerate Choosability of Graphs
- Equitable list point arboricity of graphs
This page was built for publication: Theoretical aspects of equitable partition of networks into sparse modules
