Pages that link to "Item:Q2561610"
From MaRDI portal
The following pages link to Covering the vertices of a graph by vertex-disjoint paths (Q2561610):
Displayed 10 items.
- A parallel algorithm for solving the coloring problem on trapezoid graphs (Q287107) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Path coverings of the vertices of a tree (Q1251231) (← links)
- Relating path coverings to vertex labellings with a condition at distance two (Q1343254) (← links)
- Graph methods for solving the unconstrained and constrained optimal assignment problem for locomotives on a single-line railway section (Q2034833) (← links)
- Completion and deficiency problems (Q2200922) (← links)
- The Hamiltonian problem and \(t\)-path traceable graphs (Q2357671) (← links)
- Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654) (← links)
- On the path partition number of 6‐regular graphs (Q6057632) (← links)
- Path cover problems with length cost (Q6069927) (← links)