Berge pancyclic hypergraphs
From MaRDI portal
Cites work
- A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs
- A Dirac-type theorem for uniform hypergraphs
- A generalization of Bondy's pancyclicity theorem
- A hypergraph analog of Dirac's theorem for long cycles in 2-connected graphs
- A method in graph theory
- A note on extending Bondy's meta-conjecture
- A note on Hamiltonian circuits
- A rainbow Dirac's theorem
- Avoiding long Berge cycles
- Berge cycles in non-uniform hypergraphs
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- Cycles of given lengths in hypergraphs
- Dirac-type theorems for long Berge cycles in hypergraphs
- scientific article; zbMATH DE number 3625443 (Why is no real title available?)
- scientific article; zbMATH DE number 914171 (Why is no real title available?)
- scientific article; zbMATH DE number 3186565 (Why is no real title available?)
- Hypergraphs with no cycle of a given length
- In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
- Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\)
- Note on Hamilton Circuits
- On \(r\)-uniform hypergraphs with circumference less than \(r\)
- On Hamiltonian Berge cycles in [3]-uniform hypergraphs
- On Maximal Circuits in Finite Graphs
- Pancyclic graphs and a conjecture of Bondy and Chvatal
- Pancyclic graphs. I
- Pósa-type results for Berge hypergraphs
- Some Theorems on Abstract Graphs
- The structure of hypergraphs without long Berge cycles
- Vraagstuk XXVIII.
- Weakly pancyclic graphs
This page was built for publication: Berge pancyclic hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230890)
