Partitioning regular graphs into equicardinal linear forests

DOI10.1016/0012-365X(91)90054-6MaRDI QIDQ1174174zbMATH OpenFDO

Authors R. E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito

Publication date 25 June 1992

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

regular graphlinear forests

Mathematics Subject Classification ID

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

Recommendations

• Partitioning circulant graphs into isomorphic linear forests
• scientific article; zbMATH DE number 1229605
• On isomorphic linear partitions in cubic graphs
• On isomorphic linear partitions in cubic graphs

Cites work

• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 3717365 (Why is no real title available?)
• Covering and packing in graphs IV: Linear arboricity

Cited in

(6)

• Partitioning circulant graphs into isomorphic linear forests
• Construction of 4-Regular Graphs
• Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
• On isomorphic linear partitions in cubic graphs
• On isomorphic linear partitions in cubic graphs
• A Rooted-Forest Partition with Uniform Vertex Demand

This page was built for publication: Partitioning regular graphs into equicardinal linear forests

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