Network fault costs based on minimum leaf spanning trees
From MaRDI portal
Cites work
- K2‐Hamiltonian graphs: II
- Approximating Maximum Leaf Spanning Trees in Almost Linear Time
- Every graph occurs as an induced subgraph of some hypohamiltonian graph
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
- Fast generation of planar graphs
- Generation of cubic graphs
- Graph theory and interconnection networks.
- House of graphs 2.0: a database of interesting graphs and more
- scientific article; zbMATH DE number 1305098 (Why is no real title available?)
- scientific article; zbMATH DE number 1011075 (Why is no real title available?)
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- scientific article; zbMATH DE number 227006 (Why is no real title available?)
- Leaf-critical and leaf-stable graphs
- n-Hamiltonian graphs
- On finding spanning trees with few leaves
- On minimum leaf spanning trees and a criticality notion
- On non-Hamiltonian graphs for which every vertex-deleted subgraph is traceable
- On platypus graphs and the Steiner-Deogun property
- On the minimum leaf number of cubic graphs
- On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
- Optimal 1-Hamiltonian graphs
- Practical graph isomorphism. II.
- Spanning spiders and light-splitting switches
- Structural and computational results on platypus graphs
- Toughness, hamiltonicity and split graphs
This page was built for publication: Network fault costs based on minimum leaf spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7324954)
