Domination graphs: Examples and counterexamples

Discrete Applied Mathematics

Volumn 110, Issue 2-3, 2001, Pages 289-300

  Rusu, Irena ^a   Spinrad, Jeremy ^b  

^a UNIVERSITÉ D'ORLÉANS   (France)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

Domination graph; Generalized join; Tolerance graph; Trapezoid graph

Indexed keywords

EID: 0035877349     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00274-2     Document Type: Article

References (13)

1. Bogart K.P., Fishburn P.C., Isaak G., Langley L. Proper and unit tolerance graphs. Discrete Appl. Math. 60:1995;99-117.
2. Cunningham W.H. Decomposition of directed graphs. SIAM J. Algebra Discrete Methods. 3:1982;214-228.
3. E. Dahlhaus, P.L. Hammer, F. Maffray, S. Olariu, On Domination Elimination orderings and Domination Graphs, Dans Lecture Notes in Computer Science, Vol. 903, Springer, Berlin, 1994 pp. 81-92.
4. Dirac G.A. On rigid circuit graphs. Abh. Math. Sem Univ. Hamburg. 25:1961;71-76.
5. Dushnik B., Miller E.W. Partially ordered sets. Amer. J. Math. 63:1941;600-610.
6. Gallai T. Transitiv orientbare graphen. Acta. Math. Hungar. 18:1967;25-66.
7. Golumbic M.C., Monma C.L. A generalization of interval graphs with tolerances. Congres. Numer. 35:1982;321-331.
8. Golumbic M.C., Monma C.L., Trotter W.T. Tolerance graphs. Discrete Appl. Math. 9:1984;157-170.
9. Hammer P., Maffray F. Completely separable graphs. Discrete Appl. Math. 27:1990;85-99.
10. Hayward R. Weakly triangulated graphs. J. Combin. Theory Ser. B. 39:1985;200-208.
11. Hsu W.-L. Decomposition of perfect graphs. J. Combin. Theory Ser. B. 43:1987;70-94.
12. Rose D.J., Tarjan R.E., Lueker G.S. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5:1976;266-283.
13. I. Rusu, J. Spinrad, Forbidden Subgraph Decomposition, Research Report RR-99-13, LIFO, Université d'Orléans, 1999.