Extension of paths and cycles for hypergraphs
From MaRDI portal
Publication:277496
DOI10.1016/j.endm.2013.11.002zbMath1338.05192OpenAlexW1972028693MaRDI QIDQ277496
Publication date: 29 April 2016
Full work available at URL: http://real.mtak.hu/62093/1/katona_kashan_u.pdf
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- On extremal hypergraphs for Hamiltonian cycles
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Extremal \(k\)-edge-Hamiltonian hypergraphs
- Hypergraph Extensions of the Erdős-Gallai Theorem
- On maximal paths and circuits of graphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Hamiltonian chains in hypergraphs
This page was built for publication: Extension of paths and cycles for hypergraphs