On a graph theorem by dirac

DOI10.1016/S0021-9800(67)80036-XzbMath0173.26302MaRDI QIDQ5560919

No author found.

Publication date: 1967

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

zbMATH Keywords

topology

Related Items (7)

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 ⋮ Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs ⋮ Unnamed Item ⋮ Cycle lengths in sparse graphs ⋮ On the genus and connectivity of Hamiltonian graphs ⋮ Weakly pancyclic graphs

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