Non-separating spanning trees and out-branchings in digraphsof independence number 2

by   Joergen Bang-Jensen, et al.

A subgraph H= (V, F) of a graph G= (V,E) is non-separating if G-F, that is, the graph obtained from G by deleting the edges in F, is connected. Analogously we say that a subdigraph X= (V,B) of a digraph D= (V,A) is non-separating if D-B is strongly connected. We study non-separating spanning trees and out-branchings in digraphs of independence number 2. Our main results are that every 2-arc-strong digraph D of independence number alpha(D) = 2 and minimum in-degree at least 5 and every 2-arc-strong oriented graph with alpha(D) = 2 and minimum in-degree at least 3 has a non-separating out-branching and minimum in-degree 2 is not enough. We also prove a number of other results, including that every 2-arc-strong digraph D with alpha(D)<=2 and at least 14 vertices has a non-separating spanning tree and that every graph G with delta(G)>=4 and alpha(G) = 2 has a non-separating hamiltonian path.


page 1

page 2

page 3

page 4


A Stronger Lower Bound on Parametric Minimum Spanning Trees

We prove that, for an undirected graph with n vertices and m edges, each...

Spanning eulerian subdigraphs in semicomplete digraphs

A digraph is eulerian if it is connected and every vertex has its in-deg...

Spanning trees with few branch vertices

A branch vertex in a tree is a vertex of degree at least three. We prove...

Spanning Trees With Edge Conflicts and Wireless Connectivity

We introduce the problem of finding a spanning tree along with a partiti...

A Fast Graph Program for Computing Minimum Spanning Trees

When using graph transformation rules to implement graph algorithms, a c...

On Unimodality of Independence Polynomials of Trees

An independent set in a graph is a set of pairwise non-adjacent vertices...

Maximizing the Number of Spanning Trees in a Connected Graph

We study the problem of maximizing the number of spanning trees in a con...