Tight cycles in hypergraphs
From MaRDI portal
Publication:322350
DOI10.1016/j.endm.2015.06.091zbMath1346.05196OpenAlexW2175669756MaRDI QIDQ322350
Publication date: 14 October 2016
Full work available at URL: https://arxiv.org/pdf/1411.4957
Related Items
Cites Work
- Unnamed Item
- Tight cycles in hypergraphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Hypergraph extensions of the Erdős-Gallai theorem
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Hamiltonicity in balanced \(k\)-partite graphs
- Pancyclic graphs. I
- On Hamiltonian bipartite graphs
- On maximal paths and circuits of graphs