论文信息 - Representing triangulated graphs in stars

Representing triangulated graphs in stars

A graphG is calledrepresentable in a tree T, ifG is isomorphic to the intersection graph of a family of subtrees ofT. In this paper those graphs are characterized which are representable in some subdivision of theK1,n. In the finite case polynomial-time recognition algorithms of these graphs are given. But this concept can be generalized to essentially infinite graphs by using no more trees but ‘tree-like’ posets and representability of graphs in these posets.

Erich Prisner

[1] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[2] D. R. Fulkerson. Note on Dilworth’s decomposition theorem for partially ordered sets , 1956 .

[3] C. Lekkeikerker,et al. Representation of a finite graph by a set of intervals on the real line , 1962 .

[4] Yukio Shibata,et al. On the tree representation of chordal graphs , 1988, J. Graph Theory.

[5] R. P. Dilworth,et al. A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[6] F. Gavril. The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

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

[8] James R. Walter,et al. Representations of chordal graphs as subtrees of a tree , 1978, J. Graph Theory.

[9] Philip A. Bernstein,et al. Power of Natural Semijoins , 1981, SIAM J. Comput..

[10] Rudolf Halin,et al. Some remarks on interval graphs , 1982, Comb..

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