3 citations · 9 across the 3 of their papers we have counts for
3 papers
cs.DM2014★ 3 cited
A new characterization of -free graphs
Eglantine Camby, Oliver Schaudt
The class of graphs that do not contain an induced path on vertices, -free graphs, plays a prominent role in algorithmic graph theory. This motivates the search for specia…
cs.DM2013★ 3 cited
A Note on Connected Dominating Set in Graphs Without Long Paths And Cycles
Eglantine Camby, Oliver Schaudt
The ratio of the connected domination number, , and the domination number, , is strictly bounded from above by 3. It was shown by Zverovich that for every connected $(P_5,C…
cs.DM2013★ 3 cited
The Price of Connectivity for Vertex Cover
Eglantine Camby, Jean Cardinal, Samuel Fiorini +1
The vertex cover number of a graph is the minimum number of vertices that are needed to cover all edges. When those vertices are further required to induce a connected subgraph, th…