Pages that link to "Item:Q1166539"
From MaRDI portal
The following pages link to Smallest maximally nonhamiltonian graphs (Q1166539):
Displaying 20 items.
- Upper bounds on the minimum size of Hamilton saturated hypergraphs (Q727183) (← links)
- Large Isaacs' graphs are maximally non-Hamilton-connected (Q750459) (← links)
- Nontraceable detour graphs (Q868352) (← links)
- Cubic maximal nontraceable graphs (Q868358) (← links)
- Hamilton-chain saturated hypergraphs (Q966015) (← links)
- Computer based proofs by induction in graph theory - A house of cards? (Q1310223) (← links)
- Cycle-saturated graphs of minimum size (Q1916094) (← links)
- Hamilton saturated hypergraphs of essentially minimum size (Q1953507) (← links)
- Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs (Q1981694) (← links)
- Towards obtaining a 3-decomposition from a perfect matching (Q2094896) (← links)
- Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\) (Q2111195) (← links)
- On the minimum size of Hamilton saturated hypergraphs (Q2213813) (← links)
- Spiders everywhere (Q2217501) (← links)
- On the number of edges in a minimum \(C_6\)-saturated graph (Q2354620) (← links)
- Hamiltonian path saturated graphs with small size (Q2492212) (← links)
- Structural and computational results on platypus graphs (Q2656702) (← links)
- Saturation numbers for families of graph subdivisions (Q4650190) (← links)
- $K_2$-Hamiltonian Graphs: I (Q5009329) (← links)
- On the size of maximally non-hamiltonian digraphs (Q5225023) (← links)
- Rotationally symmetric snarks from voltage graphs (Q6197742) (← links)
