Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs

DOI10.1007/s41478-022-00424-yOpenAlexW4225144610MaRDI QIDQ2093879

R. Mahendra Kumar, N. Sadagopan

Publication date: 27 October 2022

Published in: The Journal of Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41478-022-00424-y

zbMATH Keywords

vertex coverfeedback vertex setclique coverHamiltonian cycle (path)\(P_5\)-free chordal bipartite\(P_6\)-free chordal bipartite graphslongest cycle (path)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• The clique-partitioning problem
• HAMILTONian circuits in chordal bipartite graphs
• Hamiltonicity in Split Graphs - A Dichotomy
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Hamilton Paths in Grid Graphs

This page was built for publication: Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs