On distance-preserving and domination elimination orderings

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 3, 1998, Pages 414-436

  Chepoi, Victor ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Breadth first search; Distance preserving ordering; Domination elimination ordering; Lexicographic breadth first search; Weakly modular graph

Indexed keywords

EID: 0011345618     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480195291230     Document Type: Article

References (41)

1. R. P. ANSTEE AND M. FARBER, On bridged graphs and cop-win graphs, J. Combin. Theory Ser. B, 44 (1988), pp. 22-28.
2. H.-J. BANDELT, Hereditary modular graphs, Combinatorica, 8 (1988), pp. 149-157.
3. H.-J. BANDELT AND V. CHEPOI, A Helly theorem in weakly modular space, Discrete Math., 126 (1996), pp. 25-39.
4. H.-J. BANDELT AND J. HEDLÍKOVÁ, Median algebras, Discrete Math., 45 (1983), pp. 1-30.
5. H.-J. BANDELT AND H. M. MULDER, Distance-hereditary graphs, J. Combin. Theory Ser. B, 41 (1986), pp. 182-208.
6. H.-J. BANDELT AND H. M. MULDER, Pseudo-modular graphs, Discrete Math., 62 (1986), pp. 245-260.
7. H.-J. BANDELT AND H. M. MULDER, Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication, Discrete Math., 94 (1991), pp. 161-180.
8. H.-J. BANDELT AND H. M. MULDER, Cartesian factorization of interval-regular graphs having no long isometric odd cycles, in Graph Theory, Combinatorics, and Applications, Vol. 1, Y. Alavi, G. Chartrand, O. R. Oellermann, and A. J. Schwenk, eds., John Wiley, New York, 1991, pp. 55-75.
9. H.-J. BANDELT, H. M. MULDER, AND V. SOLTAN, Weak Cartesian Factorization with Icosahedra, 5-wheels, and Subhyperoctahedra as Factors, Econometric Institut report 9455, Erasmus University, Rotterdam, the Netherlands, 1994.
10. H.-J. BANDELT AND E. PESCH, Dismantling absolute retracts of reflexive graphs, European J. Combin., 10 (1989), pp. 211-220.
11. K. V. S. BHAT, On the complexity of testing a graph for n-cube, Inform. Process. Lett., 11 (1980), pp. 16-19.
12. H. BUSEMANN, The Geometry of Geodesics, Academic Press, New York, 1955.
13. H. BUSEMANN AND B. B. PHADKE, Peakless and monotone functions on G-spaces, Tsukuba J. Math., 7 (1983), pp. 105-135.
14. H. BUSEMANN AND B. B. PHADKE, Novel results in the geometry of geodesics, Adv. Math., 101 (1993), pp. 180-219.
15. J. W. CANNON, Almost convex groups, Geom. Dedicata, 22 (1987), pp. 197-210.
16. V. CHEPOI, Classifying graphs by metric triangles, Metody Diskret. Anal., 49 (1989), pp. 75-93 (in Russian).
17. V. CHEPOI, Peakless functions on graphs, Discrete Appl. Math., 73 (1997), pp. 175-189.
18. V. CHEPOI, Bridged graphs are cop-win graphs: An algorithmic proof, J. Combin. Theory Ser. B, 69 (1997), pp. 97-100.
19. F. DRAGAN, F. NICOLAI, AND A. BRANDSTÄDT, Convexity and HHD-free Graphs, Tech. report SM-DU-290, Gerhard-Mercator-Universität-Gesamthochschule, Duisburg, Germany, 1995.
20. F. DRAGAN, Personal communication, 1995.
21. E. DAHLHAUS, P. HAMMER, F. MAFFRAY, AND S. OLARIU, On domination elimination orderings and domination graphs, in Graph-Theoretic Concepts in Computer Science, WG'94, Lecture Notes in Comput. Sci., 903, Springer-Verlag, New York, 1994, pp. 81-92.
22. M. FARBER AND R. E. JAMISON, Convexity in graphs and hypergraphs, SIAM J. Algebraic Discrete Meth., 7 (1986), pp. 433-444.
23. M. FARBER AND R. E. JAMISON, On local convexity in graphs, Discrete Math., 66 (1987), pp. 231-247.
24. B. JAMISON AND S. OLARIU, On the semi-perfect elimination, Adv. Appl. Math., 9 (1988), pp. 364-376.
25. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
26. P. HAMMER, B. SIMEONE, T. LIEBLING, AND D. DE WERRA, From linear separability to unimodality: A hierarchy of pseudo-Boolean functions, SIAM J. Discrete Math., 1 (1988), pp. 174-184.
27. P. HAMMER AND F. MAFFRAY, Completely separable graphs, Discrete Appl. Math., 27 (1990), pp. 85-99.
28. R. B. HAYWARD, Weakly triangulated graphs, J. Combin. Theory Ser. B, 39 (1985), pp. 200-208.
29. E. HOWORKA, A characterization of distance-hereditary graphs, Quart. J. Math. Oxford Ser. 2, 28 (1977), pp. 417-420.
30. H. M. MULDER, The Interval Function of a Graph, Math. Centre Tracts 132, Amsterdam, 1980.
31. R. NOWAKOWSKI AND P. WINKLER, Vertex-to-vertex pursuit in a graph, Discrete Math., 43 (1983), pp. 235-239.
32. R. NOWAKOWSKI AND I. RIVAL, The smallest graph variety containing all paths, Discrete Math., 43 (1983), pp. 223-234.
33. A. QUILLIOT, On the Helly property working as a compactness criterion on graphs, J. Combin. Theory Ser. A, 40 (1985), pp. 186-193.
34. A. QUILLIOT, Homomorphismes, points fixes, rétractions et jeux de poursuite dans les graphes, les ensembles ordonnés et les espaces métriques, Thèse d'Etat, Université de Paris VI, Paris, France, 1983.
35. D. ROSE, R. TARJAN, AND G. LUEKER, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
36. R. SCHARLAU, Metrical shellings of simplicial complexes, European J. Combin., 6 (1985), pp. 265-269.
37. D. R. SHIER, Some aspects of perfect elimination orderings in chordal graphs, Discrete Appl. Math., 7 (1984), pp. 325-331.
38. V. SOLTAN AND V. CHEPOI, Conditions for invariance of set diameters under d-convexification in a graph, Cybernetics, 19 (1983), pp. 750-756.
39. R. E. TARJAN AND M. YANNAKAKIS, Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput., 13 (1984), pp. 566-579.
40. G. ZIEGLER, Lectures on Polytopes, Springer-Verlag, New York, 1994.
41. K. H. WILLIAMSON, Completely unimodal numberings of a simple polytope, Discrete Appl. Math., 20 (1988), pp. 69-81.