Pages that link to "Item:Q4446888"
From MaRDI portal
The following pages link to How many disjoint 2-edge paths must a cubic graph have? (Q4446888):
Displaying 14 items.
- Total transversals and total domination in uniform hypergraphs (Q405218) (← links)
- Packing 3-vertex paths in claw-free graphs and related topics (Q617645) (← links)
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730) (← links)
- Algorithm for two disjoint long paths in 2-connected graphs (Q986559) (← links)
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835) (← links)
- A local search algorithm for binary maximum 2-path partitioning (Q1799391) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
- On path lengths modulo three (Q3978369) (← 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)
- Maximum odd induced subgraph of a graph concerning its chromatic number (Q6642508) (← links)
- The maximum 3-star packing problem in claw-free cubic graphs (Q6645157) (← links)
- Packing 2- and 3-stars into \(( 2 , 3 )\)-regular graphs (Q6657246) (← links)
