A generalization of Dirac's theorem

DOI10.1007/BF02579378zbMath0576.05034OpenAlexW2084074102MaRDI QIDQ1065022

Stephen C. Locke

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579378

zbMATH Keywords

cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (9)

Extremal 3-connected graphs ⋮ Heavy fans, cycles and paths in weighted graphs of large connectivity ⋮ Cycles and paths through specified vertices in k-connected graphs ⋮ Bipartite independent number and Hamilton-biconnectedness of bipartite graphs ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ Cycles through three vertices in 2-connected graphs ⋮ Long paths and cycles passing through specified vertices under the average degree condition ⋮ Long cycles through specified vertices in a graph ⋮ Weighted degrees and heavy cycles in weighted graphs

Cites Work

• A basis for the cycle space of a 2-connected graph
• Long cycles generate the cycle space of a graph
• On maximal paths and circuits of graphs
• Long paths and large cycles in finite graphs
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalization of Dirac's theorem