Robust Connectivity of Graphs on Surfaces

@article{Bradshaw2022RobustCO,
  title={Robust Connectivity of Graphs on Surfaces},
  author={Peter Bradshaw and Tom{\'a}{\vs} Masař{\'i}k and Jana Novotn{\'a} and Ladislav Stacho},
  journal={ArXiv},
  year={2022},
  volume={abs/2104.12030}
}
Let Λ(T ) denote the set of leaves in a tree T . One natural problem is to look for a spanning tree T of a given graph G such that Λ(T ) is as large as possible. This problem is called maximum leaf number, and it is a well-known NP-hard problem. Equivalently, the same problem can be formulated as the minimum connected dominating set problem, where the task is to find a smallest subset of vertices D ⊆ V (G) such that every vertex of G is in the closed neighborhood of D. Throughout recent decades… 

References

SHOWING 1-10 OF 43 REFERENCES
Solving Connected Dominating Set Faster than 2n
TLDR
A simple O(1.9407n) algorithm for the connected dominating set problem is presented, which makes use of new domination rules, and its analysis is based on the Measure and Conquer technique.
Solving Connected Dominating Set Faster than 2 n
TLDR
A simple O(1.9407n) algorithm for the connected dominating set problem is presented, which makes use of new domination rules, and its analysis is based on the Measure and Conquer technique.
Spanning trees with many leaves in cubic graphs
TLDR
A simple construction and a complete proof of a result of Storer that if G is a connected cubic graph on n vertices, then L(G) ⩾ [(n/4) + 2], and this is best possible for all (even) n.
Minimum feedback vertex set and acyclic coloring
An exact algorithm for the Maximum Leaf Spanning Tree problem
Given an undirected graph G with n nodes, the Maximum Leaf Spanning Tree problem asks to find a spanning tree of G with as many leaves as possible. When parameterized in the number of leaves k, this
Maximum and minimum toughness of graphs of small genus
Spanning Trees with Many Leaves
TLDR
The lower bounds of the maximum integer m such that every connected n-vertex graph with minimum degree at least k has a spanning tree with at least m leaves are proved.
Fractional vertex-arboricity of planar graphs
We initiate a systematic study of the fractional vertex-arboricity of planar graphs and demonstrate connections to open problems concerning both fractional coloring and the size of the largest
Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs
TLDR
It is proved that every connected and locally connected graph with more than 3 vertices contains a homeomorphically irreducible spanning tree (HIST), which confirms the following conjecture due to Archdeacon: every graph that triangulates some surface has a HIST.
Minimum size of feedback vertex sets of planar graphs of girth at least five
...
...