论文信息 - Quasi-threshold Graphs

Quasi-threshold Graphs

Abstract Quasi-threshold graphs are defined recursively by the following rules: 1. (1) K 1 is a quasi-threshold graph, 2. (2) adding a new vertex adjacent to all vertices of a quasi-threshold graph results in a quasi-threshold graph, 3. (3) the disjoint union of two quasi-threshold graphs is a quasi-threshold graph. This paper gives some new equivalent definitions of a quasi-threshold graph. From them, linear time recognition algorithms follow. We also give linear time algorithms for the edge domination problem and the bandwidth problem in this class of graphs.

Gerard J. Chang | Jing-Ho Yan | Jer-Jeong Chen

[1] Wen-Lian Hsu,et al. A Simple Test for Interval Graphs , 1992, WG.

[2] P. Duchet. Classical Perfect Graphs: An introduction with emphasis on triangulated and interval graphs , 1984 .

[3] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[4] 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..

[5] Norman E. Gibbs,et al. The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[6] Hans-Jürgen Bandelt,et al. Distance-hereditary graphs , 1986, J. Comb. Theory B.

[7] Derek G. Corneil,et al. Complement reducible graphs , 1981, Discret. Appl. Math..

[8] Lorna Stewart,et al. A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[9] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[10] E. S. Wolk. A note on “The comparability graph of a tree” , 1965 .

[11] Martin Charles Golumbic,et al. Trivially perfect graphs , 1978, Discret. Math..

[12] E. S. Wolk. The comparability graph of a tree , 1962 .