Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
From MaRDI portal
Publication:882106
DOI10.1016/j.disc.2006.09.031zbMath1117.05074OpenAlexW1978020077MaRDI QIDQ882106
Publication date: 23 May 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.031
Related Items (4)
Graphs with maximal induced matchings of the same size ⋮ Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) ⋮ Weighted well-covered claw-free graphs ⋮ Greedily constructing maximal partial \(f\)-factors
Cites Work
- Unnamed Item
- Graphs where every maximal path is maximum
- On randomly Hamiltonian graphs
- Graphs in which every finite path is contained in a circuit
- Randomly antitraceable digraphs
- Recognizing Greedy Structures
- Graphs in which every path is contained in a Hamilton path.
- Randomly Traceable Graphs
- Randomly hamiltonian digraphs
This page was built for publication: Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
