Metric graph theory and geometry: a survey, Contemporary Mathematics, vol.453, pp.49-86, 2008. ,
Distance-hereditary graphs, Journal of Combinatorial Theory, Series B, vol.41, issue.2, pp.182-208, 1986. ,
A note on exact algorithms for vertex ordering problems on graphs, Theory of Computing Systems, vol.50, issue.3, pp.420-432, 2012. ,
A c k n 5-approximation algorithm for treewidth, SIAM Journal on Computing, vol.45, issue.2, pp.317-378, 2016. ,
Graph theory with applications, vol.290, 1976. ,
Dually chordal graphs, SIAM Journal on Discrete Mathematics, vol.11, issue.3, pp.437-455, 1998. ,
Homogeneously orderable graphs, Theoretical Computer Science, vol.172, issue.1, pp.209-232, 1997. ,
Discretization vertex orders in distance geometry, Discrete Applied Mathematics, vol.197, pp.27-41, 2015. ,
, Weakly modular graphs and nonpositive curvature, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01199930
Cop and robber games when the robber can hide and ride, SIAM Journal on Discrete Mathematics, vol.25, issue.1, pp.333-359, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00622957
On distance-preserving and domination elimination orderings, SIAM Journal on Discrete Mathematics, vol.11, issue.3, pp.414-436, 1998. ,
, Tandem-win graphs. Discrete Mathematics, vol.299, pp.56-64, 2005.
The complexity of theorem-proving procedures, Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC '71, pp.151-158, 1971. ,
Unified view of graph searching and LDFS-based certifying algorithms, Encyclopedia of Algorithms, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01255083
Vertex ordering characterizations of graphs of bounded asteroidal number, Journal of Graph Theory, vol.78, issue.1, pp.61-79, 2015. ,
A note on Integer Linear Programming formulations for linear ordering problems on graphs ,
URL : https://hal.archives-ouvertes.fr/hal-01271838
To approximate treewidth, use treelength! SIAM Journal on Discrete Mathematics, vol.30, issue.3, pp.1424-1436, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01348965
The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Information and computation, vol.85, pp.12-75, 1990. ,
URL : https://hal.archives-ouvertes.fr/hal-00353765
On domination elimination orderings and domination graphs, Graph-Theoretic Concepts in Computer Science, pp.81-92 ,
, , 1995.
Graph theory, volume 173 of Graduate texts in mathematics, 1997. ,
A simple linear time algorithm for cograph recognition, Discrete Applied Mathematics, vol.145, issue.2, pp.183-197, 2005. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00105298
Counterexamples in discrete geometry, 2004. ,
, , 2016.
On the semi-perfect elimination, Advances in applied mathematics, vol.9, issue.3, pp.364-376, 1988. ,
Vertex-to-vertex pursuit in a graph, Discrete Mathematics, vol.43, issue.2, pp.235-239, 1983. ,
Clustering social networks using distancepreserving subgraphs, The Influence of Technology on Social Network Analysis and Mining, vol.6, pp.331-349, 2013. ,
Preliminary results on distance-preserving graphs, Congressus Numerantium, vol.211, pp.141-149, 2012. ,
Algorithmic aspects of vertex elimination on graphs, SIAM Journal on computing, vol.5, issue.2, pp.266-283, 1976. ,
On distance preserving and sequentially distance preserving graphs, 2017. ,
The Sage Development Team, Sage Mathematics Software System, 2017. ,
Recognition of collapsible complexes is NP-complete, Discrete & Computational Geometry, vol.55, issue.1, pp.21-38, 2016. ,
A non-shellable 3-sphere, European Journal of Combinatorics, vol.6, issue.1, pp.91-100, 1985. ,