Optimal 1-Hamiltonian graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1222841
- Brother trees: A family of optimal 1p-Hamiltonian and 1-edge Hamiltonian graphs
- Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs
- Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\)
- Conditional fault Hamiltonicity of the complete graph
Cites work
- scientific article; zbMATH DE number 913340 (Why is no real title available?)
- Edge fault tolerance in graphs
- Graph theory
- Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
- Hypohamiltonian and hypotraceable graphs
- Maximally non-hamiltonian graphs of girth 7
- On a construction of Thomassen
Cited in
(14)- Christmas tree: a versatile 1-fault-tolerant design for token rings
- Brother trees: A family of optimal 1p-Hamiltonian and 1-edge Hamiltonian graphs
- Über 1-optimale Graphen
- Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
- Investigating the existence and the regularity of logarithmic Harary graphs
- Embedding Wheel - like Networks
- Hamiltonian properties of enhanced honeycomb networks
- Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\)
- Construction schemes for fault-tolerant Hamiltonian graphs
- Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs
- Globally bi-3*-connected graphs
- Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs
- The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks
- Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs
This page was built for publication: Optimal 1-Hamiltonian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293225)
