Spanning spiders and light-splitting switches
From MaRDI portal
Publication:1877652
Recommendations
- Near-optimal light spanners
- Near-optimal light spanners
- Spanning trees whose stems are spiders
- Spanders: distributed spanning expanders
- Distributed Construction of Light Networks
- Spanning line configurations
- The configuration space of a spider
- Multipath spanners
- On the configuration space of a spider
Cites work
- scientific article; zbMATH DE number 637321 (Why is no real title available?)
- scientific article; zbMATH DE number 2038756 (Why is no real title available?)
- scientific article; zbMATH DE number 2086635 (Why is no real title available?)
- scientific article; zbMATH DE number 1421019 (Why is no real title available?)
- scientific article; zbMATH DE number 3349867 (Why is no real title available?)
- A note on Hamiltonian circuits
- A sufficient condition for a graph to have a \(k\)-tree
- Finding long paths and cycles in sparse Hamiltonian graphs
- Hamiltonicity for K1, r‐free graphs
- Hypohamiltonian and hypotraceable graphs
- Longest paths and cycles in K1,3-free graphs
- Maximal trees with bounded maximum degree in a graph
- Note on Hamilton Circuits
- On approximating the longest path in a graph
- On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
- Planar cubic hypohamiltonian and hypotraceable graphs
- Some Theorems on Abstract Graphs
Cited in
(38)- Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
- Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
- On the computational difficulty of the terminal connection problem
- Leaf-critical and leaf-stable graphs
- Relations, models and a memetic approach for three degree-dependent spanning tree problems
- Spanning Trees with Few Branch Vertices
- Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs
- Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
- On spanning trees with few branch vertices
- On the terminal connection problem
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
- On finding spanning trees with few leaves
- Degree conditions for spanning brooms
- The spanning k-trees, perfect matchings and spectral radius of graphs
- Spanning trees with a bounded number of branch vertices in a claw-free graph
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
- Spanning 5-ended trees in \(K_{1,5}\)-free graphs
- Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs
- Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs
- The distance spectral radius of graphs with given number of odd vertices
- Approximating spanning trees with few branches
- A multivariate analysis of the strict terminal connection problem
- Spanning trees whose stems are spiders
- Spanning trees homeomorphic to a small tree
- Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
- Spanning trees whose stems have a bounded number of branch vertices
- Depth first search in claw-free graphs
- On non-traceable, non-hypotraceable, arachnoid graphs
- Neighborhood unions and extremal spanning trees
- Spider covers and their applications
- scientific article; zbMATH DE number 2038756 (Why is no real title available?)
- Spiders everywhere
- Gallai's question and constructions of almost hypotraceable graphs
- Degree sums and spanning brooms of a graph
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
- Spanning trees: A survey
- On minimum leaf spanning trees and a criticality notion
This page was built for publication: Spanning spiders and light-splitting switches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877652)
