Hamiltonian circuits and path coverings of vertices in graphs
From MaRDI portal
Publication:4041608
DOI10.4064/cm-30-2-295-316zbMath0291.05110OpenAlexW876312943MaRDI QIDQ4041608
Publication date: 1974
Published in: Colloquium Mathematicum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/cm-30-2-295-316
Related Items (11)
The path-partition problem in block graphs ⋮ Relating path coverings to vertex labellings with a condition at distance two ⋮ Path partition number in tough graphs ⋮ \(k\)-path partitions in trees ⋮ On the \(k\)-path partition of graphs. ⋮ Completion and deficiency problems ⋮ Path partition for graphs with special blocks ⋮ Hamiltonian path saturated graphs with small size ⋮ On a class of posets and the corresponding comparability graphs ⋮ Path coverings of the vertices of a tree ⋮ Unnamed Item
This page was built for publication: Hamiltonian circuits and path coverings of vertices in graphs
