Cycle Extendability of Hamiltonian Strongly Chordal Graphs

DOI10.1137/20M1369920zbMath1473.05150arXiv2007.04698OpenAlexW3201644946MaRDI QIDQ4959662

Wenjun Li, Yongjie Yang, Jianxin Wang, Guozhen Rong

Publication date: 17 September 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.04698

zbMATH Keywords

chordal graphsHamiltonian graphscycle extendability

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Further results on Hendry's Conjecture

Cites Work

• Unnamed Item
• Towards a characterization of leaf powers by clique arrangements
• Extending cycles in directed graphs
• Extending cycles in graphs
• On rigid circuit graphs
• Structure and linear time recognition of 3-leaf powers
• Characterizations of strongly chordal graphs
• Extending cycles in bipartite graphs
• Planar Hamiltonian chordal graphs are cycle extendable
• Well-partitioned chordal graphs: obstruction set and disjoint paths
• Some remarks about leaf roots
• Leaf Powers and Their Properties: Using the Trees
• A characterization of ptolemaic graphs
• Hamiltonian Chordal Graphs are not Cycle Extendable
• Hamiltonian Spider Intersection Graphs Are Cycle Extendable
• Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
• Cycle Extendability of Hamiltonian Interval Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Cycle Extendability of Hamiltonian Strongly Chordal Graphs