On a graph theorem by dirac

DOI10.1016/S0021-9800(67)80036-XMaRDI QIDQ5560919zbMATH OpenFDO

Authors Øystein Ore

Publication date 1967

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

Full work available at URL https://doi.org/10.1016/S0021-9800(67)80036-X

zbMATH Keywords

topology

Cited in

(8)

• Weakly pancyclic graphs
• Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
• Length of longest cycles in a graph whose relative length is at least two
• On the genus and connectivity of Hamiltonian graphs
• Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
• scientific article; zbMATH DE number 1496607 (Why is no real title available?)
• Stability in Bondy's theorem on paths and cycles
• Cycle lengths in sparse graphs

This page was built for publication: On a graph theorem by dirac

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