Toughness and Hamiltonicity of strictly chordal graphs

DOI10.1111/itor.12319OpenAlexW2460427158MaRDI QIDQ6070991

Christina Fraga Esteves Maciel Waga, Lilian Markenzon

Publication date: 27 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12319

zbMATH Keywords

Hamiltonicitychordal graphstoughnessstrictly chordal graphs

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

The scattering number of strictly chordal graphs: linear time determination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New results on Ptolemaic graphs
• Extending cycles in graphs
• Strictly chordal graphs are leaf powers
• 1-tough cocomparability graphs are hamiltonian
• Measuring the vulnerability for classes of intersection graphs
• Planar Hamiltonian chordal graphs are cycle extendable
• Block duplicate graphs and a hierarchy of chordal graphs
• Algorithmic graph theory and perfect graphs
• Toughness, hamiltonicity and split graphs
• An efficient representation of chordal graphs
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• One-phase algorithm for the determination of minimal vertex separators of chordal graphs
• More than one tough chordal planar graphs are Hamiltonian
• Hamiltonian Chordal Graphs are not Cycle Extendable
• Hamiltonian Spider Intersection Graphs Are Cycle Extendable
• Tough spiders

This page was built for publication: Toughness and Hamiltonicity of strictly chordal graphs