Minimum Degrees for Powers of Paths and Cycles
From MaRDI portal
Recommendations
- Square Hamiltonian cycles in graphs with maximal 4-cliques
- Pósa's conjecture for graphs of order at least 2 × 108
- An Ore-type theorem on Hamiltonian square cycles
- scientific article; zbMATH DE number 1286511
- Proof of the Seymour conjecture for large graphs
- On a degree sequence analogue of Pósa's conjecture
- On degree sequences forcing the square of a Hamilton cycle
- The Square of a Hamiltonian Cycle
- Minimum degree conditions for large subgraphs
- Hamiltonian powers in threshold and arborescent comparability graphs
Cites work
- An approximate Dirac-type theorem for k-uniform hypergraphs
- Blow-up lemma
- Embedding spanning subgraphs in uniformly dense and inseparable graphs
- Filling the gap between Turán's theorem and Pósa's conjecture
- Forcing large tight components in 3-graphs
- Hamiltonian square-paths
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- Large planar subgraphs in dense graphs
- On degree sequences forcing the square of a Hamilton cycle
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- On the structure of linear graphs
- Panconnected graphs. II
- Proof of the Seymour conjecture for large graphs
- Some Theorems on Abstract Graphs
- The square of paths and cycles
- Tight cycles and regular slices in dense hypergraphs
Cited in
(13)- Tight bounds for powers of Hamilton cycles in tournaments
- Powers of Hamilton cycles of high discrepancy are unavoidable
- Minimum degree conditions for large subgraphs
- scientific article; zbMATH DE number 6692113 (Why is no real title available?)
- Filling the gap between Turán's theorem and Pósa's conjecture
- Induced Subgraphs of the Power of a Cycle
- A note on powers of Hamilton cycles in generalized claw-free graphs
- scientific article; zbMATH DE number 1286511 (Why is no real title available?)
- Average degree in graph powers
- Minimum degrees for powers of paths and cycles
- The union power Cayley graph for cyclic groups and its properties
- Powers of Hamiltonian cycles in \(\mu\)-inseparable graphs
- Minimum degree conditions for powers of cycles and paths
This page was built for publication: Minimum Degrees for Powers of Paths and Cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048302)
