Hamiltonian cycles in n‐extendable graphs

DOI10.1002/JGT.10050MaRDI QIDQ4539871zbMATH OpenOpenAlexFDO

Authors Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito

Publication date 11 July 2002

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10050

zbMATH Keywords

\(n\)-extendable graphdegree sumHamiltonian cyclesperfect matching

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Hamiltonian extendable graphs
• Hamilton cycles in \(n\)-extendable bipartite graphs.
• Hamilton paths in \(n\)-extendable bipartite graphs.
• Hamiltonian cycle properties in k-extendable non-bipartite graphs with high connectivity
• scientific article; zbMATH DE number 734454

Cites work

• Degree sums, \(k\)-factors and Hamilton cycles in graphs
• Hamiltonian results inK1,3-free graphs
• Long cycles in graphs with large degree sums
• Note on Hamilton Circuits
• On Maximal Circuits in Finite Graphs
• On n-extendable graphs
• The binding number of a graph and its Anderson number

Cited in

(26)

• M-alternating Hamilton paths and M-alternating Hamilton cycles
• A cycle structure theorem for Hamiltonian graphs
• Hamiltonian cycles in T-graphs
• Thin Hamiltonian cycles on Archimedean graphs
• Degree conditions and cycle extendability
• Hamilton cycles in some vertex-transitive graphs
• Independence number in n-extendable graphs
• On extendability of co-edge-regular graphs
• Hamiltonian and long cycles in bipartite graphs with connectivity
• Hamiltonian extendable graphs
• Hamiltonian cycle properties in k-extendable non-bipartite graphs with high connectivity
• On extendability of Deza graphs with diameter 2
• On the extendability of quasi-strongly regular graphs with diameter 2
• Extending cycles locally to Hamilton cycles
• scientific article; zbMATH DE number 5901724 (Why is no real title available?)
• Note on odd path extendable graphs
• Finding Hamilton cycles in robustly expanding digraphs
• Hamilton cycles in almost distance-hereditary graphs
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Hamilton cycles in \(n\)-extendable bipartite graphs.
• N‐extendability of symmetric graphs
• Cycle Extendability of Hamiltonian Strongly Chordal Graphs
• Hamilton paths in \(n\)-extendable bipartite graphs.
• Long cycles in \(n\)-extendable bipartite graphs.
• Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
• The classification of \(2\)-extendable edge-regular graphs with diameter \(2\)

This page was built for publication: Hamiltonian cycles in n‐extendable graphs

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