Eglantine Camby

According to our database, Eglantine Camby authored at least 10 papers between 2012 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2019

Price of Connectivity for the Vertex Cover Problem and the Dominating Set Problem: Conjectures and Investigation of Critical Graphs.

Eglantine Camby

Graphs Comb., 2019

2018

A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree.

Romain Absil, Eglantine Camby, Alain Hertz, Hadrien Mélot

Discret. Appl. Math., 2018

2017

A note on an induced subgraph characterization of domination perfect graphs.

Eglantine Camby, Fränk Plein

Discret. Appl. Math., 2017

2016

A New Characterization of P_k-Free Graphs.

Eglantine Camby, Oliver Schaudt

Algorithmica, 2016

2014

The Price of Connectivity for Vertex Cover.

Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt

Discret. Math. Theor. Comput. Sci., 2014

The price of connectivity for dominating set: Upper bounds and complexity.

Eglantine Camby, Oliver Schaudt

Discret. Appl. Math., 2014

A new characterization of $P_k$-free graphs.

Eglantine Camby, Oliver Schaudt

CoRR, 2014

2013

A Note on Connected Dominating Set in Graphs Without Long Paths And Cycles

Eglantine Camby, Oliver Schaudt

CoRR, 2013

Connected dominating set in graphs without long paths and cycles.

Eglantine Camby, Oliver Schaudt

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs.

Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012