论文信息 - Structure theorems for some circular-arc graphs

Structure theorems for some circular-arc graphs

A proper circular-arc graph is a graph that has an intersection model formed by a family of overlapping arcs on some circle in which no arc contains another. A unit circular-arc graph is a graph that has an intersection model formed by a family of unit-length arcs on some circle. This paper gives structure theorems for proper circular-arc graphs and for unit circular-arc graphs.

Alan Tucker | Alan C. Tucker

[1] V. Klee. What Are the Intersection Graphs of Arcs in a Circle , 1969 .

[2] Harold Fredricksen. Generation of the Ford Sequence of Length 2n, n Large , 1972, J. Comb. Theory, Ser. A.

[3] S. Benzer. ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE. , 1959, Proceedings of the National Academy of Sciences of the United States of America.

[4] A. Tucker,et al. A structure theorem for the consecutive 1's property☆ , 1972 .

[5] P. Renz. Intersection representations of graphs by arcs. , 1970 .

[6] A. Tucker,et al. Matrix characterizations of circular-arc graphs , 1971 .