A Rooted-Forest Partition with Uniform Vertex Demand

DOI10.1007/978-3-642-11440-3_17MaRDI QIDQ3404442zbMATH OpenOpenAlexFDO

Authors Naoki Katoh, Shin-Ichi Tanigawa

Publication date 9 February 2010

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11440-3_17

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A rooted-forest partition with uniform vertex demand
• Equitable partition of graphs into induced forests
• On the uniform edge-partition of a tree
• On the vertex partition of planar graphs into forests with bounded degree
• scientific article; zbMATH DE number 5526012
• Equitable partition of graphs into induced linear forests
• Vertex partitioning problems on graphs with bounded tree width
• Partitioning regular graphs into equicardinal linear forests
• Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
• Vertex partitioning problems on partial k-trees

Cited in

(1)

• A rooted-forest partition with uniform vertex demand

This page was built for publication: A Rooted-Forest Partition with Uniform Vertex Demand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404442)