Path factors in cubic graphs
From MaRDI portal
Publication:3651178
DOI10.1002/jgt.10022zbMath1176.05064OpenAlexW4233263631MaRDI QIDQ3651178
Yoshiaki Oda, Ken-ichi Kawarabayashi, Katsuhiro Ota, Haruhide Matsuda
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
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs, Path factors in subgraphs, Graph factors and factorization: 1985--2003: a survey, \(P_3\)-factors in the square of a tree, Approximating maximum edge 2-coloring in simple graphs, Induced path factors of regular 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, Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement, Some existence theorems on path factors with given properties in graphs, An improved approximation algorithm for maximum edge 2-coloring in simple graphs, Path-factors in the square of a tree, Packing \([1, \Delta \)-factors in graphs of small degree], The existence of a path-factor without small odd paths, A note on \({\mathtt V}\)-free 2-matchings, 2-factors of cubic bipartite graphs, 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 clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph, Path factors and line graphs, The existence of path-factor covered graphs
Cites Work
