MinimumK-hamiltonian graphs
From MaRDI portal
Publication:3317136
Recommendations
Cited in
(21)- Graph theory (algorithmic, algebraic, and metric problems)
- Tolerating faults in a mesh with a row of spare nodes
- Minimumk-hamiltonian graphs, II
- scientific article; zbMATH DE number 4135980 (Why is no real title available?)
- Optimal 1-edge fault-tolerant designs for ladders.
- Designing distrance-preserving fault-tolerant topologies
- Subgraphs intersecting any Hamiltonian cycle
- A result about the incident edges in the graphs \(M_ k\)
- Extremal k-edge-hamiltonian Hypergraphs
- Explicit construction of linear sized tolerant networks. (Reprint)
- 2-edge-Hamiltonian-connectedness of 4-connected plane graphs
- scientific article; zbMATH DE number 3999969 (Why is no real title available?)
- scientific article; zbMATH DE number 438460 (Why is no real title available?)
- scientific article; zbMATH DE number 4093499 (Why is no real title available?)
- On the construction of combined \(k\)-fault-tolerant Hamiltonian graphs
- Hamiltonian Chains in Hypergraphs
- Powers of connected graphs and hamiltonicity
- The number of cycles in a Hamilton graph
- Extremal \(k\)-edge-Hamiltonian hypergraphs
- Explicit construction of linear sized tolerant networks
- One node fault tolerance for caterpillars and starlike trees
This page was built for publication: MinimumK-hamiltonian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3317136)
