论文信息 - Multitrack Interval Graphs

Multitrack Interval Graphs

A d-track interval is a union of d intervals, one each from d parallel lines. The intersection graphs of d-track intervals are the unions of d interval graphs. The multitrack interval number or simply track number of a graph G is the minimum number of interval graphs whose union is G. The track number for K m;n is determined by proving that the arboricity of K m;n equals its \caterpillar arboricity". Recognition of graphs with track number 2 is shown to be NP-complete.

D. West

[1] David S. Johnson,et al. The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

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

[3] Jerrold R. Griggs. Extremal values of the interval number of a graph, II , 1979, Discret. Math..

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

[5] Douglas B. West,et al. The interval number of a planar graph: Three intervals suffice , 1983, J. Comb. Theory, Ser. B.

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

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

[8] Jeremy P. Spinrad,et al. An improved edge bound on the interval number of a graph , 1987, J. Graph Theory.

[9] Fred S. Roberts,et al. On dimensional properties of graphs , 1989, Graphs Comb..

[10] Douglas B. West. A short proof of the degree bound for interval number , 1989, Discret. Math..

[11] João Meidanis,et al. Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs , 1992, SWAT.

[12] Jan Kratochvíl. A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness , 1994, Discret. Appl. Math..

[13] Gábor Tardos. Transversals of 2-intervals, a topological approach , 1995, Comb..