The following pages link to Path factors in cubic graphs (Q3651178):
Displayed 12 items.
- Approximating maximum edge 2-coloring in simple graphs (Q608271) (← 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)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
- Path factors and line graphs (Q3439616) (← links)
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement (Q3511418) (← links)