Hamilton-chain saturated hypergraphs
From MaRDI portal
Publication:966015
DOI10.1016/j.disc.2009.11.014zbMath1230.05220MaRDI QIDQ966015
Aneta Dudek, Gyula Y. Katona, Andrzej Żak
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.014
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arc coverings of graphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Smallest maximally nonhamiltonian graphs
- Smallest maximally nonhamiltonian graphs. II
- Extremal \(k\)-edge-Hamiltonian hypergraphs
- Hamiltonian path saturated graphs with small size
- Lower bound for the size of maximal nontraceable graphs
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Hamiltonian chains in hypergraphs
- Graphs maximal with respect to absence of hamiltonian paths
- Variations on the Hamiltonian Theme