A characterization of circle graphs

DOI10.1016/S0195-6698(84)80005-0zbMath0551.05056MaRDI QIDQ801089

Hubert de Fraysseix

Publication date: 1984

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

circle graph; chord intersection graph; circular permutation; double occurrence sequence

Mathematics Subject Classification ID

05A05: Permutations, words, matrices

05B35: Combinatorial aspects of matroids and geometric lattices

05C75: Structural characterization of families of graphs

Related Items

Distance Hereditary Graphs and the Interlace Polynomial, Characterizing graphic matroids by a system of linear equations, On the linear algebra of local complementation, The interlace polynomial of a graph, Topological realizations of ortho-projection graphs, Independent sets and chromatic numbers of circle graphs, Diamond-free circle graphs are Helly circle, Reconnaissance des graphes de cordes, Reducing prime graphs and recognizing circle graphs, Representations of graphs and networks (coding, layouts and embeddings), Bipartite graphs that are not circle graphs, A proof of a circle graph characterization, Euler circuits and DNA sequencing by hybridization, Structural results on circular-arc graphs and circle graphs: a survey and the main open problems, Circle graph obstructions under pivoting

Cites Work

• Graphes de cordes et espaces graphiques
• Local complementation and interlacement graphs
• On the Principal Edge Tripartition of a Graph
• Sur Un Problème De Configurations Et Sur Les Fractions Continues
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item