The following pages link to Eglantine Camby (Q300475):
Displaying 8 items.
- A new characterization of \(P_k\)-free graphs (Q300476) (← links)
- The price of connectivity for dominating set: upper bounds and complexity (Q406321) (← links)
- A note on an induced subgraph characterization of domination perfect graphs (Q516908) (← links)
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044) (← links)
- Expected distance based on random walks (Q1708510) (← links)
- Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs (Q1733857) (← links)
- A New Characterization of $$P_k$$-free Graphs (Q2945184) (← links)
- The Price of Connectivity for Vertex Cover (Q5413911) (← links)
