A characterization of circle graphs (Q801089): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:15, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A characterization of circle graphs |
scientific article |
Statements
A characterization of circle graphs (English)
0 references
1984
0 references
A double occurrence sequence is a finite sequence of letters on an alphabet, defined up to a circular permutation, such that each letter has exactly two occurrences in S. A simple graph is a circle graph if it is the interlacement graph of a double-occurrence sequence. A circle graph can be viewed as a chord intersection graph. The author proves that a connected graph is a circle graph if and only if it is a cocyclic-path intersection graph (simple graph with vertex set being a family of cocyclic paths of a given graph, two vertices being adjacent if and only if the corresponding cocyclic paths have an edge in common). He restates this result in terms of matroid theory.
0 references
double occurrence sequence
0 references
circular permutation
0 references
circle graph
0 references
chord intersection graph
0 references