Partitioning circulant graphs into isomorphic linear forests

DOI10.1007/BF02669837MaRDI QIDQ1864211zbMATH OpenOpenAlexWikidataFDO

Authors Wenfeng Hu, Jianfang 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)

Recommendations

• Partitioning regular graphs into equicardinal linear forests
• On isomorphic linear partitions in cubic graphs
• Factorisation of regular graphs into forests of short paths
• scientific article; zbMATH DE number 1229605
• The linear arboricity of some regular graphs

Cites work

• scientific article; zbMATH DE number 3717365 (Why is no real title available?)
• Covering and packing in graphs IV: Linear arboricity
• Partitioning regular graphs into equicardinal linear forests

Cited in

(3)

• Construction of 4-Regular Graphs
• On the linearK-arboricity of cubic graphs
• Factorisation of regular graphs into forests of short paths

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

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