×

zbMATH — the first resource for mathematics

Algorithms on circular-arc graphs. (English) Zbl 0309.05126

MSC:
05C35 Extremal problems in graph theory
68W99 Algorithms in computer science
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Gilmore, Canad. J. Math. 16 pp 539– (1964) · Zbl 0121.26003
[2] Lekkerkerker, Fund. Math. Polska Akad. Nauk 51 pp 45– (1962)
[3] Fulkerson, Pacific J. Math. 15 pp 835– (1965) · Zbl 0132.21001
[4] Gavril, SIAM J. Comput. 1 pp 180– (1972)
[5] Rose, J. Math. Anal. Appl. 32 pp 597– (1970)
[6] Paull, IRE Trans. on Electronic Computers EC-8 pp 356– (1959)
[7] and , Combinatorial Geometry in the Plane, Holt Rinehardt and Winston, New York, 1964, p. 54.
[8] Klee, Amer. Math. Monthly 76 pp 810– (1969)
[9] Tucker, Pacific J. Math. 38 pp 535– (1971) · Zbl 0226.05125
[10] and , ”On Finding a Maximum Independent Stable Set of a Graph,” Proc. of Fourth Annual Princeton Conference on Information Sciences and Systems, Princeton, New Jersey, 1970.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.