论文信息 - On the interval number of a chordal graph

On the interval number of a chordal graph

The interval number of a (simple, undirected) graph G is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t real intervals. A chordal (or triangulated) graph is one with no induced cycles on 4 or more vertices. If G is chordal and has maximum clique size ω(G) = m, then i(G) ⩽ [1 + o(1)]m/log2m and this result is best possible, even for split graphs (chordal graphs whose complement is also chordal).

Edward R. Scheinerman

[1] Thomas Andreae. On the Interval Number of a Triangulated Graph , 1987, J. Graph Theory.

[2] Edward R. Scheinerman. Irredundancy in multiple interval representations , 1987, Discret. Math..

[3] Edward R. Scheinerman,et al. The maximum interval number of graphs with given genus , 1987, J. Graph Theory.

[4] Frank Harary,et al. On double and multiple interval graphs , 1979, J. Graph Theory.

[5] Thomas Andreae. On an extremal problem concerning the interval number of a graph , 1986, Discret. Appl. Math..

[6] Douglas B. West,et al. Extremal Values of the Interval Number of a Graph , 1980, SIAM J. Matrix Anal. Appl..

[7] G. Dirac. On rigid circuit graphs , 1961 .

[8] Christoph Maas. A lower bound for the interval number of a graph , 1984 .

[9] Paul Erdös,et al. A note on the interval number of a graph , 1985, Discret. Math..

[10] William T. Trotter,et al. The interval number of a complete multipartite graph , 1984, Discret. Appl. Math..

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

[12] Edward R. Scheinerman. Irrepresentability by multiple intersection, or why the interval number is unbounded , 1985, Discret. Math..

[13] David B. Shmoys,et al. Recognizing graphs with fixed interval number is NP-complete , 1984, Discret. Appl. Math..