Partitions of a graph into cycles containing a specified linear forest

DOI10.7151/DMGT.1394zbMATH Open1170.05039OpenAlexW2010461454MaRDI QIDQ3527529

Hajime Matsumura, Ryota Matsubara

Publication date: 29 September 2008

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6046f7ac8dd45b0338c73e0f8715ac5a654dc63a

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

On a cycle through a specified linear forest of a graph ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Pancyclic graphs and linear forests

This page was built for publication: Partitions of a graph into cycles containing a specified linear forest

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