Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs

zbMATH Open1158.05333MaRDI QIDQ1010695FDOQ1010695

Authors: Terry A. McKee 

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129718

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 815104
• A necessary and sufficient condition for a bipartite distance-hereditary graph to be Hamiltonian
• scientific article; zbMATH DE number 1222095
• The Hamiltonian problem on distance-hereditary graphs
• Hamilton cycles in almost distance-hereditary graphs

zbMATH Keywords

induced subgraphdistance hereditary graphshamiltonian cycleparity graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75)

Cited In (2)

• Requiring adjacent chords in cycles
• Title not available (Why is that?)

This page was built for publication: Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs

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