The following pages link to MinimumK-hamiltonian graphs (Q3317136):
Displaying 17 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Powers of connected graphs and hamiltonicity (Q798671) (← links)
- Subgraphs intersecting any Hamiltonian cycle (Q1077429) (← links)
- Explicit construction of linear sized tolerant networks (Q1110541) (← links)
- A result about the incident edges in the graphs \(M_ k\) (Q1313883) (← links)
- Tolerating faults in a mesh with a row of spare nodes (Q1330431) (← links)
- The number of cycles in a Hamilton graph (Q1336706) (← links)
- Optimal 1-edge fault-tolerant designs for ladders. (Q1853116) (← links)
- Extremal \(k\)-edge-Hamiltonian hypergraphs (Q2476283) (← links)
- Explicit construction of linear sized tolerant networks. (Reprint) (Q2498004) (← links)
- 2-edge-Hamiltonian-connectedness of 4-connected plane graphs (Q2509769) (← links)
- On the construction of combined \(k\)-fault-tolerant Hamiltonian graphs (Q2719848) (← links)
- Extremal k-edge-hamiltonian Hypergraphs (Q3438961) (← links)
- Hamiltonian Chains in Hypergraphs (Q3439478) (← links)
- Minimumk-hamiltonian graphs, II (Q3720636) (← links)
- One node fault tolerance for caterpillars and starlike trees (Q4876347) (← links)
- Designing distrance-preserving fault-tolerant topologies (Q6550558) (← links)
