Hamilton paths in graphs whose vertices are graphs

zbMATH Open1100.05060MaRDI QIDQ5488886FDOQ5488886

Authors: Krystyna T. Balińska, Michael L. Gargano, Louis V. Quintas, Krzysztof T. Zwierzyński 

Publication date: 25 September 2006

Recommendations

• On the hamiltonian path graph of a graph
• On minimum degree in Hamiltonian path graphs
• scientific article; zbMATH DE number 4091550
• Hamilton paths in certain arithmetic graphs.
• scientific article; zbMATH DE number 438460

zbMATH Keywords

vertex-transitive

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cited In (10)

• Title not available (Why is that?)
• Hamilton paths and cycles in vertex-transitive graphs of order \(6p\)
• Hamiltonian path saturated graphs with small size
• Hamiltonian paths in distance graphs
• Hamilton paths in certain arithmetic graphs.
• Hamiltonian paths in some classes of grid graphs
• Title not available (Why is that?)
• Segment endpoint visibility graphs are Hamiltonian
• Graphs whose vertices are forests with bounded degree: traceability
• Hamilton paths in dominating graphs of trees and cycles

This page was built for publication: Hamilton paths in graphs whose vertices are graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488886)