Equitable partition of graphs into induced linear forests
From MaRDI portal
Publication:2292162
DOI10.1007/S10878-019-00498-8zbMATH Open1434.05058arXiv1908.05075OpenAlexW2989779890MaRDI QIDQ2292162FDOQ2292162
Publication date: 3 February 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Abstract: It is proved that the vertex set of any simple graph can be equitably partitioned into subsets for any integer so that each of them induces a linear forest.
Full work available at URL: https://arxiv.org/abs/1908.05075
Recommendations
Cites Work
- Title not available (Why is that?)
- Equitable partition of graphs into induced forests
- Equitable vertex arboricity of subcubic graphs
- A conjecture on equitable vertex arboricity of graphs
- Equitable vertex arboricity of graphs
- Equitable vertex arboricity of planar graphs
- Equitable partition of plane graphs with independent crossings into induced forests
- Equitable vertex arboricity of 5-degenerate graphs
Cited In (8)
- Theoretical aspects of equitable partition of networks into sparse modules
- Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
- Complexity of tree-coloring interval graphs equitably
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs
- Equitable vertex arboricity conjecture holds for graphs with low degeneracy
- Equitable partition of plane graphs with independent crossings into induced forests
- On Equitable List Arboricity of Graphs
- A Rooted-Forest Partition with Uniform Vertex Demand
This page was built for publication: Equitable partition of graphs into induced linear forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292162)
