Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs
From MaRDI portal
Publication:949579
Recommendations
Cites work
- Christmas tree: a versatile 1-fault-tolerant design for token rings
- Construction schemes for fault-tolerant Hamiltonian graphs
- Edge fault tolerance in graphs
- Flip-Flops in Hypohamiltonian Graphs
- Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
- scientific article; zbMATH DE number 913340 (Why is no real title available?)
- New flip-flop constructions for hypohamiltonian graphs
- Optimal 1-Hamiltonian graphs
- Parallel concepts in graph theory
Cited in
(8)- Brother trees: A family of optimal 1p-Hamiltonian and 1-edge Hamiltonian graphs
- Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\)
- A recursively construction scheme for super fault-tolerant Hamiltonian graphs
- Optimal 1-Hamiltonian graphs
- scientific article; zbMATH DE number 1222841 (Why is no real title available?)
- Construction schemes for fault-tolerant Hamiltonian graphs
- Embedding Wheel - like Networks
- On 4-ordered 3-regular graphs
This page was built for publication: Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949579)