A necessary and sufficient condition for a bipartite distance-hereditary graph to be Hamiltonian

DOI10.1007/978-3-642-45281-9_14MaRDI QIDQ2864339zbMATHOpenAlexFDO

Authors Masahide Takasuga, Tomio Hirata

Publication date 6 December 2013

Published in Computational Geometry and Graphs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45281-9_14

Mathematics Subject Classification ID

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

Recommendations

• Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
• Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
• scientific article; zbMATH DE number 1347011
• scientific article; zbMATH DE number 3847429
• A sufficient condition for Hamiltonians in balanced bipartite graphs

Cited in

(4)

• Structural properties of word representable graphs
• scientific article; zbMATH DE number 5630886 (Why is no real title available?)
• Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs
• The \(F\)-Hamiltonian problem for bipartite graphs

This page was built for publication: A necessary and sufficient condition for a bipartite distance-hereditary graph to be Hamiltonian

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