Hamiltonian threshold for strong products of graphs
From MaRDI portal
Publication:3630836
DOI10.1002/jgt.20314zbMath1194.05071WikidataQ57601491 ScholiaQ57601491MaRDI QIDQ3630836
Publication date: 4 June 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20314
Related Items
On the geodetic and the hull numbers in strong product graphs, Cyclic colorings of plane graphs with independent faces, Connectivity of strong products of graphs
Cites Work
- Unnamed Item
- On factors with given components
- Advances on the Hamiltonian problem -- a survey
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Pancyclicity of strong products of graphs
- Hamiltonian circuits in certain prisms
- Hamiltonian Cycles in Strong Products of Graphs
- Updating the hamiltonian problem—A survey
- Hamiltonian Cycles in Products of Graphs
- A Survey of Combinatorial Gray Codes