Matrix characterizations of circular-arc graphs
Work
Year: 1971
Type: article
Abstract: : A graph G is a circular-arc graph if there is a 1-1 correspondence between the vertices of G and a family of arcs on a circle such that two distinct vertices are adjacent when the corresponding arc... more
Source: Pacific Journal of Mathematics
Author Alan Tucker
Cites: 22
Cited by: 168
Related to: 10
FWCI: 8.839
Citation percentile (by year/subfield): 98.93
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze