Asteroidal Triple-Free Graphs
暂无分享,去创建一个
[1] C. Lekkeikerker,et al. Representation of a finite graph by a set of intervals on the real line , 1962 .
[2] Amir Pnueli,et al. Permutation Graphs and Transitive Graphs , 1972, JACM.
[3] Peter C. Fishburn,et al. Partial orders of dimension 2 , 1972, Networks.
[4] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[5] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[6] Kellogg S. Booth,et al. A Linear Time Algorithm for Deciding Interval Graph Isomorphism , 1979, JACM.
[7] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[8] D. Corneil,et al. A recognition algorithm for II-graphs , 1990 .
[9] Stephan Olariu. On the homogeneous representation of interval graphs , 1991, J. Graph Theory.
[10] Stephan Olariu. On sources in comparability graphs, with applications , 1992, Discret. Math..
[11] Dieter Kratsch,et al. Domination on Cocomparability Graphs , 1993, SIAM J. Discret. Math..
[12] Stephan Olariu,et al. A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph , 1995, Inf. Process. Lett..
[13] Rolf H. Möhring,et al. Triangulating Graphs Without Asteroidal Triples , 1996, Discret. Appl. Math..