6 citations · 24 across the 32 of their papers we have counts for
3 papers · 1 filter
Exponential Independence in Subcubic Graphs
Stéphane Bessy, Johannes Pardey, Dieter Rautenbach
A set of vertices of a graph is exponentially independent if, for every vertex in , $$\sum\limits_{v\in S\setminus \{ u\}}\left(\frac{1}{2}\right)^{{\rm dist}_{(G,S)…
Non-separating spanning trees and out-branchings in digraphsof independence number 2
Joergen Bang-Jensen, Stéphane Bessy, Anders Yeo
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…
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2
Joergen Bang-Jensen, Stephane Bessy, Frederic Havet +1
We prove that every digraph of independence number at most 2 and arc-connectivity at least 2 has an out-branching and an in-branching which are arc-disjoint (we call su…