Restricted circular-arc graphs and clique cycles

Authors:
Terry A. McKee
Affiliations:
Department of Mathematics and Statistics, Wright State University, Dayton, OH
Venue:
Discrete Mathematics
Year:
2003

Citing 7
Cited 2

An algorithm for fraternal orientation of graphs

Information Processing Letters
In-tournament digraphs

Journal of Combinatorial Theory Series B
Intersection graphs of concatenable subtrees of graphs

Discrete Applied Mathematics
Intersection graphs of proper subtrees of unicyclic graphs

Journal of Graph Theory
Intersection graphs of Helly families of subtrees

Discrete Applied Mathematics
Acyclic hypergraph projections

Journal of Algorithms
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)

Normal Helly circular-arc graphs and its subclasses

Discrete Applied Mathematics
Characterization of classical graph classes by weighted clique graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

Circular-arc graphs are natural analogs of chordal and interval graphs, but without some of the features that make chordal and interval graphs particularly nice; perhaps, the biggest difference is the failure of the Helly condition. Restricting circular-arc representations so as to have no three or fewer arcs cover the entire circle and to have the endpoints of arcs be distinguishable by other arcs results in a notion of 'restricted circular-arc graphs' that enjoys many of the nice features of chordal graphs. Their theory is surprisingly parallel to that of chordal graphs, substituting 'clique cycles' for clique trees, but they also have several distinctive features and characterizations.