scientific article; zbMATH DE number 3641483
From MaRDI portal
Publication:4200095
zbMath0413.05041MaRDI QIDQ4200095
Dominique Sotteau, Marie-Claude Heydemann, Jean-Claude Bermond, Anne Germa
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
cyclesuniform hypergraphsedge partitiontheorem of Dirachamiltonian cyclestheorem of Orehamiltonian hypergraphs
Related Items (29)
Spanning surfaces in \(3\)-graphs ⋮ Counting Hamilton cycles in Dirac hypergraphs ⋮ Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree ⋮ Hamiltonian paths and cycles in some 4-uniform hypergraphs ⋮ Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs ⋮ The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs ⋮ Minimum degree ensuring that a hypergraph is Hamiltonian-connected ⋮ On extremal hypergraphs for Hamiltonian cycles ⋮ Unnamed Item ⋮ A Dirac-type theorem for Berge cycles in random hypergraphs ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Unnamed Item ⋮ Loose Hamilton cycles in hypergraphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Decompositions of complete uniform hypergraphs into Hamilton Berge cycles ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Decompositions of complete 3-uniform hypergraphs into cycles of constant prime length ⋮ A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs ⋮ On the Hamiltonicity of triple systems with high minimum degree ⋮ Unnamed Item ⋮ Hamilton-chain saturated hypergraphs ⋮ Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs ⋮ Hamiltonian decompositions of complete \(k\)-uniform hypergraphs ⋮ Hamilton \(\ell \)-cycles in uniform hypergraphs ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Hamilton cycles in hypergraphs below the Dirac threshold ⋮ Unnamed Item ⋮ Berge cycles in non-uniform hypergraphs ⋮ Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs
This page was built for publication:
