Partitioning circulant graphs into isomorphic linear forests

DOI10.1007/BF02669837zbMATH Open1012.05136OpenAlexW2317971675WikidataQ126226901 ScholiaQ126226901MaRDI QIDQ1864211FDOQ1864211

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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)