Unimodularity and circle graphs
✍ Scribed by André Bouchet
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 309 KB
- Volume
- 66
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
A property of unimodularity is introduced for antisymmetric integral matrices. It is satisfied by the adjacency matrix of a circle graph provided with a Naji orientation . In a further paper we shall interprete this result in terms of symmetric matroids introduced in . In this communication we give a direct proof by means of techniques used in for an algorithmic solution of the Gauss problem on self-intersecting curves in the plane.
📜 SIMILAR VOLUMES
A chordal graph is called restricted unimodular if each cycle of its vertex-clique incidence bipartite graph has length divisible by 4. We characterize these graphs within all chordal graphs by forbidden induced subgraphs, by minimal relative separators, and in other ways. We show how to construct t
This paper presents a new algorithm for recognizing circle graphs, combining ideas from an earlier circle graph recognition algorithm due to Gabor, Hsu, and Supowit and an algorithm to determine whether a graph can be decomposed by the split decomposition. The result is an \(O\left(n^{2}\right)\) al