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 graphchord intersection graphcircular permutationdouble occurrence sequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75)

Related Items

Improved bounds for colouring circle graphs, A tight relation between series-parallel graphs and bipartite distance hereditary graphs, Topological realizations of ortho-projection graphs, A proof of a circle graph characterization, Reducing prime graphs and recognizing circle graphs, The complexity of colouring circle graphs, Treewidth, Circle Graphs, and Circular Drawings, Independent sets and chromatic numbers of circle graphs, Characterizing graphic matroids by a system of linear equations, Structural results on circular-arc graphs and circle graphs: a survey and the main open problems, Representations of graphs and networks (coding, layouts and embeddings), On the linear algebra of local complementation, Diamond-free circle graphs are Helly circle, Distance Hereditary Graphs and the Interlace Polynomial, The interlace polynomial of a graph, Isotropic matroids. II: Circle graphs, A characterization of circle graphs in terms of multimatroid representations, Circle graph obstructions under pivoting, Bipartite graphs that are not circle graphs, Euler circuits and DNA sequencing by hybridization, Reconnaissance des graphes de cordes

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