Hamiltonian threshold graphs

DOI10.1016/0166-218X(87)90050-3zbMath0601.05033MaRDI QIDQ1080870

Frank Harary, Uri N. Peled

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

cliquethreshold graphhamiltonicityindependent set I

Mathematics Subject Classification ID

Graph theory (05C99) Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

Some complexity results about threshold graphs ⋮ Total matchings and total coverings of threshold graphs ⋮ Split graphs ⋮ Notes on Hamiltonian threshold and chain graphs ⋮ Longest cycles in threshold graphs ⋮ Mock threshold graphs ⋮ Hyper-Hamiltonicity in graphs: some sufficient conditions ⋮ On hyper-Hamiltonicity in graphs ⋮ Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs ⋮ Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues ⋮ Bipartite bithreshold graphs ⋮ The polytope of degree sequences ⋮ P-antiregular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Necessary conditions for Hamiltonian split graphs
• A note on Hamiltonian split graphs
• Parallel concepts in graph theory
• On Hamilton's ideals
• On Hamiltonian bipartite graphs
• Threshold Sequences

This page was built for publication: Hamiltonian threshold graphs