Minimum degree ensuring that a hypergraph is Hamiltonian-connected

DOI10.1016/j.ejc.2023.103782zbMath1522.05347arXiv2207.14794OpenAlexW4385896089MaRDI QIDQ6080369

Alexandr V. Kostochka, Grace McCourt, Ruth Luo

Publication date: 2 October 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.14794

zbMATH Keywords

Hamiltonian-connected graphHamiltonian Berge cycleHamiltonian Berge path

Mathematics Subject Classification ID

Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Hamilton connected graphs
• A Dirac-type theorem for Berge cycles in random hypergraphs
• Note on Hamilton Circuits
• A Rainbow Dirac's Theorem
• A sufficient condition for hamiltonian connectedness
• n-Hamiltonian graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Minimum degree ensuring that a hypergraph is Hamiltonian-connected