Path and cycle factors of cubic bipartite graphs

DOI10.7151/dmgt.1426zbMath1173.05028OpenAlexW2034647200MaRDI QIDQ3633845

Kazuhiro Suzuki, Mikio Kano, Chang Woo Lee

Publication date: 23 June 2009

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

Full work available at URL: https://doi.org/10.7151/dmgt.1426

zbMATH Keywords

bipartite graphpath factorcycle factor

Mathematics Subject Classification ID

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

Related Items (16)

Component factors and binding number conditions in graphs ⋮ Path factors in subgraphs ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ \(P_3\)-factors in the square of a tree ⋮ Path factors and neighborhoods of independent sets in graphs ⋮ Isolated toughness and path-factor uniform graphs. II. ⋮ Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ Some sufficient conditions for path-factor uniform graphs ⋮ Edge-connectivity and edges of even factors of graphs ⋮ The existence of a path-factor without small odd paths ⋮ A note on \({\mathtt V}\)-free 2-matchings ⋮ 2-factors of cubic bipartite graphs ⋮ Component factors of the Cartesian product of graphs ⋮ The existence of path-factor covered graphs

This page was built for publication: Path and cycle factors of cubic bipartite graphs