A proof of a circle graph characterization (Q1367045)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1062454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A proof of a circle graph characterization |
scientific article; zbMATH DE number 1062454 |
Statements
A proof of a circle graph characterization (English)
0 references
24 February 1998
0 references
A circle graph is an intersection graph of a non-empty finite set of chords of a circle. By using a theorem of Bouchet, this paper redemonstrates easily a result obtained by Naji which characterizes circle graphs by resolving a system of linear equations of \(\text{GF}(2)\).
0 references
circle graph
0 references
intersection graph
0 references
chords
0 references
0.8233605623245239
0 references
0.8199189901351929
0 references
