Path factors in cubic graphs

DOI10.1002/JGT.10022MaRDI QIDQ3651178zbMATH OpenOpenAlexFDO

Authors Ken-ichi Kawarabayashi, Haruhide Matsuda, Yoshiaki Oda, Katsuhiro Ota

Publication date 8 December 2009

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10022

zbMATH Keywords

cubic graphsF-factorpath factorspanning subgraph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5027031
• Path and cycle factors of cubic bipartite graphs
• A note on path factors in claw-free graphs.
• P₃-factors in the line graphs of 2-edge-connected graphs
• 2-factors of cubic bipartite graphs

Cites work

• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Factors and factorizations of graphs—a survey
• Private Observation, Communication and Collusion

Cited in

(31)

• On path factors of \((3,4)\)-biregular bigraphs
• Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
• Approximating maximum edge 2-coloring in simple graphs via local improvement
• Hamiltonicity and pancyclicity of Cartesian products of graphs
• The existence of a path-factor without small odd paths
• 2-factors of cubic bipartite graphs
• The existence of path-factor covered graphs
• Path factors in subgraphs
• Some existence theorems on path factors with given properties in graphs
• The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
• Packing \([1, \Delta ]\)-factors in graphs of small degree
• \(P_3\)-factors in the square of a tree
• Path factors and line graphs
• Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
• Path and cycle factors of cubic bipartite graphs
• P₃-factors in the line graphs of 2-edge-connected graphs
• On detectable factorizations of cubic graphs
• Induced path factors of regular graphs
• Approximating maximum edge 2-coloring in simple graphs
• Packing 2- and 3-stars into cubic graphs
• The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices
• Degree conditions for path-factors in graphs
• Degree sum conditions for path-factor uniform graphs
• Characterizing path-factor uniform graphs with respect to the degree sum of non-adjacent vertices
• Binding number conditions for path-factor uniform graphs
• Characterizing path-factor deleted graphs via \(Q\)-index and \(\mathcal{D}\)-index
• A note on \({\mathtt V}\)-free 2-matchings
• An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
• Graph factors and factorization: 1985--2003: a survey
• An improved approximation algorithm for maximum edge 2-coloring in simple graphs
• Path-factors in the square of a tree

This page was built for publication: Path factors in cubic graphs

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