Partitioning circulant graphs into isomorphic linear forests

DOI10.1007/BF02669837zbMath1012.05136OpenAlexW2317971675WikidataQ126226901 ScholiaQ126226901MaRDI QIDQ1864211

Wenfeng Hu, Jian-fang Wang

Publication date: 17 March 2003

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02669837

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Partitioning regular graphs into equicardinal linear forests
• Covering and packing in graphs IV: Linear arboricity

This page was built for publication: Partitioning circulant graphs into isomorphic linear forests