On F-Hamiltonian graphs

DOI10.1016/S0012-365X(98)00216-7MaRDI QIDQ1297420zbMATH OpenWikidataFDO

Authors Zhenqi Yang

Publication date 29 September 1999

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(98)00216-7

zbMATH Keywords

\(F\)-Hamiltonian1-factorbipartite graphHamiltonian cycle

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• The F-Hamiltonian problem for bipartite graphs
• scientific article; zbMATH DE number 13217
• scientific article; zbMATH DE number 1347011
• Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
• Hamiltonian ?-factors in graphs

Cited in

(11)

• A look at cycles containing specified elements of a graph
• Combinatorial PDEs on Hamming graphs
• Perfect matchings and Hamiltonicity in the Cartesian product of cycles
• Recent advances on the Hamiltonian problem: survey III
• Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
• The F-Hamiltonian problem for bipartite graphs
• scientific article; zbMATH DE number 13217 (Why is no real title available?)
• scientific article; zbMATH DE number 1347011 (Why is no real title available?)
• A note on Frucht diagrams, Boolean graphs and Hamilton cycles
• Cycle partitions in dense regular digraphs and oriented graphs
• Cycle partition of dense regular digraphs and oriented graphs (extended abstract)

This page was built for publication: On \(F\)-Hamiltonian graphs

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