Structure theorems for some circular-arc graphs

66Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

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. © 1974 North-Holland Publishing Company.

Cite

CITATION STYLE

APA

Tucker, A. (1974). Structure theorems for some circular-arc graphs. Discrete Mathematics, 7(1–2), 167–195. https://doi.org/10.1016/S0012-365X(74)80027-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free