Path coverings of the vertices of a tree
From MaRDI portal
Publication:1251231
DOI10.1016/0012-365X(79)90153-5zbMath0391.05020WikidataQ128018129 ScholiaQ128018129MaRDI QIDQ1251231
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (5)
Long cycles and long paths in the Kronecker product of a cycle and a tree ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ A linear algorithm for the number of degree constrained subforests of a tree
Cites Work
- Arc coverings of graphs
- On a special class of hamiltonian graphs
- On randomly Hamiltonian graphs
- Covering the vertices of a graph by vertex-disjoint paths
- Hamiltonian circuits and path coverings of vertices in graphs
- Advances on the Hamiltonian Completion Problem
- On the optional hamiltonian completion problem
- Graphs in which every path is contained in a Hamilton path.
- Randomly Traceable Graphs
- Randomly hamiltonian digraphs
- Unnamed Item
This page was built for publication: Path coverings of the vertices of a tree