The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices
From MaRDI portal
(Redirected from Publication:6144493)
Recommendations
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
- Approximation algorithm for the distance-3 independent set problem on cubic graphs
- Distance-\(d\) independent set problems for bipartite and chordal graphs
- Factors and factorizations of graphs—a survey
- How many disjoint 2-edge paths must a cubic graph have?
- scientific article; zbMATH DE number 6511304 (Why is no real title available?)
- Linear-time computability of combinatorial problems on series-parallel graphs
- Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths
- On maximum \(P_3\)-packing in claw-free subcubic graphs
- On packing 3-vertex paths in a graph
- On Restricted Two-Factors
- On the Complexity of General Graph Factor Problems
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
- Packing 3-vertex paths in claw-free graphs and related topics
- Packing three-vertex paths in 2-connected cubic graphs.
- Packings by cliques and by finite families of graphs
- Packings by Complete Bipartite Graphs
- Parallel Processing and Applied Mathematics
- Path factors in cubic graphs
- Path factors of bipartite graphs
- Some existence theorems on path factors with given properties in graphs
- The \(K_r\)-packing problem
- The path partition problem and related problems in bipartite graphs
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
- Toughness, isolated toughness and path factors in graphs
Cited in
(2)
This page was built for publication: The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144493)
