The following pages link to Path factors in cubic graphs (Q3651178):
Displayed 23 items.
- Approximating maximum edge 2-coloring in simple graphs (Q608271) (← links)
- A note on \({\mathtt V}\)-free 2-matchings (Q727204) (← links)
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- An improved approximation algorithm for maximum edge 2-coloring in simple graphs (Q935838) (← links)
- Path-factors in the square of a tree (Q937248) (← links)
- On path factors of \((3,4)\)-biregular bigraphs (Q1014829) (← links)
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835) (← links)
- Approximating maximum edge 2-coloring in simple graphs via local improvement (Q1035687) (← links)
- Hamiltonicity and pancyclicity of Cartesian products of graphs (Q1045164) (← links)
- The existence of a path-factor without small odd paths (Q1753005) (← links)
- 2-factors of cubic bipartite graphs (Q2032697) (← links)
- The existence of path-factor covered graphs (Q2107737) (← links)
- Path factors in subgraphs (Q2161249) (← links)
- Some existence theorems on path factors with given properties in graphs (Q2199110) (← links)
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph (Q2339429) (← links)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
- \(P_3\)-factors in the square of a tree (Q2657058) (← links)
- Path factors and line graphs (Q3439616) (← links)
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement (Q3511418) (← links)
- Induced path factors of regular graphs (Q6055940) (← links)
- Packing 2- and 3-stars into cubic graphs (Q6095048) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)