2001•Unpublished venueRequires access

Clique graphs of Helly circular arc graphs.

Guillermo Durán, Min Chih Lin

Abstract

Abstract: Clique graphs of several classes of graphs have been already characterized. Trees, interval graphs, chordal graphs, block graphs, clique-Helly graphs are some of them. However, no characterization of clique graphs of circular-arc graphs and some of their subclasses is known. In this paper, we present a characterization theorem of clique graphs of Helly circular-arc graphs and prove that this subclass of circular-arc graphs is contained in the intersection between proper circular-arc graphs, clique-Helly circular-arc graphs and Helly circular-arc graphs. Furthermore, we prove properties about the 2-nd iterated clique graph of this family of graphs. Keywords: Circular-arc graphs, clique graphs, Helly circular-arc graphs, intersection graphs. 1-

About this research paper

What this paper is about

Why it matters

OpenAlex reports 15 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Chordal graph, Clique-sum, Combinatorics, Indifference graph, Mathematics, Split graph, Block graph, Cograph