Pancyclic graphs and a conjecture of Bondy and Chvatal

DOI10.1016/0095-8956(74)90043-4MaRDI QIDQ1394236zbMATH OpenOpenAlexFDO

Authors E. Schmeichel, S. Louis Hakimi

Publication date 1974

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(74)90043-4

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites work

• Arc coverings of graphs
• scientific article; zbMATH DE number 3425637 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3293646 (Why is no real title available?)
• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• Note on Hamilton Circuits
• On Hamilton's ideals
• On Hamiltonian Circuits in Finite Graphs
• Pancyclic graphs. I
• Pancyclic graphs. II
• Some Theorems on Abstract Graphs

Cited in

(24)

• A cycle structure theorem for Hamiltonian graphs
• A condition for a Hamiltonian bipartite graph to be bipancyclic
• Frequency partitions: Forcibly pancyclic and forcibly nonhamiltonian degree sequences
• Locally pancyclic graphs
• On cycle lengths in graphs of moderate degree
• Small cycles in Hamiltonian graphs
• A new Chvátal type condition for pancyclicity
• Hamiltonian degree conditions for tough graphs
• Graphic sequences with a realization containing cycles \(C_3, \dots, C_\ell \)
• Some spectral sufficient conditions for a graph being pancyclic
• Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
• An implicit degree condition for pancyclicity of graphs
• Graphs and degree sequences. I
• An implicit degree Ore-condition for pancyclicity of graphs
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Some recent results in hamiltonian graphs
• Graph theory (algorithmic, algebraic, and metric problems)
• Best monotone degree conditions for binding number
• Spectral conditions of pancyclicity for t-tough graphs
• Berge pancyclic hypergraphs
• The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
• The Hamiltonicity and pancyclicity of split graphs
• Size conditions for pancyclicity of t-tough graphs
• Hamiltonian degree conditions which imply a graph is pancyclic

This page was built for publication: Pancyclic graphs and a conjecture of Bondy and Chvatal

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