scientific article; zbMATH DE number 1409195
From MaRDI portal
Publication:4940034
Recommendations
Cited in
(23)- Smallest maximally nonhamiltonian graphs. II
- On the number of maximally non-Hamiltonian graphs
- Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs
- On the number of edges in a minimum \(C_6\)-saturated graph
- The smallest strictly Neumaier graph and its generalisations
- Hamiltonian path saturated graphs with small size
- Non-isomorphic smallest maximally non-Hamiltonian graphs
- scientific article; zbMATH DE number 4174965 (Why is no real title available?)
- scientific article; zbMATH DE number 4043879 (Why is no real title available?)
- scientific article; zbMATH DE number 4081595 (Why is no real title available?)
- scientific article; zbMATH DE number 125496 (Why is no real title available?)
- scientific article; zbMATH DE number 220408 (Why is no real title available?)
- Construction of maximally non-Hamiltonian graphs
- Smallest Graphs Achieving the Stinson Bound
- On the size of maximally non-Hamiltonian digraphs
- Further results on maximal nontraceable graphs of smallest size
- Saturation for the 3-uniform loose 3-cycle
- Minimum saturated graphs without 4-cycles and 5-cycles
- Graphs with many Hamiltonian paths
- The saturation number of C₆
- Large Isaacs' graphs are maximally non-Hamilton-connected
- Cubic maximal nontraceable graphs
- Hamilton-chain saturated hypergraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4940034)
