Hamiltonicity of complements of middle graphs
From MaRDI portal
Publication:870983
DOI10.1016/j.disc.2006.07.028zbMath1118.05056OpenAlexW1998171682MaRDI QIDQ870983
Publication date: 15 March 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.028
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Traversability and connectivity of the middle graph of a graph
- Parallel concepts in graph theory
- Subgraph distances in graphs defined by edge transfers
- Hamiltonian jump graphs
- The transformation graph \(G^{xyz}\) when \(xyz=-++\)
- A note on Hamiltonian circuits
- Hamiltonian Total Graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
This page was built for publication: Hamiltonicity of complements of middle graphs