Restricted circular-arc graphs and clique cycles
type: Item
instance of: scholarly article
title: Restricted circular-arc graphs and clique cycles
zbMATH Open document ID: 1017.05083
DOI: 10.1016/S0012-365X(02)00578-2
author: Terry A. McKee
published in: Discrete Mathematics
publication date: 2003-04-09T00:00:00Z
review text: A circular-arc graph is the intersection graph of a system of circular arcs in the plane. It is Helly, if it has the property that whenever every two arcs in the mentioned system \({\mathcal A}\) have a point in common, then so have all arcs of \({\mathcal A}\). It is said to be restricted, if and only if it satisfies the following two conditions: (A1) The points of \({\mathcal A}\) are not covered by three of fewer arcs in \({\mathcal A}\). (A2) If \(p\), \(p'\) are endpoints of an arc in \({\mathcal A}\), then there is an arc in \({\mathcal A}\) that contains \(p\) but not \(p'\). These concepts are studied and compared with analogous concepts for the so-called clique trees.
reviewed by: Bohdan Zelinka
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C62
zbMATH DE Number: 1895999
zbMATH Keywords: circular-arc graphs
zbMATH Keywords: Helly circular-arc graphs
zbMATH Keywords: chordal graphs
zbMATH Keywords: clique trees
zbMATH Keywords: clique cycles
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1895999