Covering the vertices of a graph by vertex-disjoint paths

DOI10.2140/pjm.1975.58.159zbMath0264.05122OpenAlexW2009063613MaRDI QIDQ2561610

Shahbaz Noorvash

Publication date: 1975

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1975.58.159

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (10)

The Hamiltonian problem and \(t\)-path traceable graphs ⋮ A parallel algorithm for solving the coloring problem on trapezoid graphs ⋮ Relating path coverings to vertex labellings with a condition at distance two ⋮ Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ On the path partition number of 6‐regular graphs ⋮ Completion and deficiency problems ⋮ Path cover problems with length cost ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Graph methods for solving the unconstrained and constrained optimal assignment problem for locomotives on a single-line railway section ⋮ Path coverings of the vertices of a tree

This page was built for publication: Covering the vertices of a graph by vertex-disjoint paths