A characterization of circle graphs
From MaRDI portal
Publication:801089
DOI10.1016/S0195-6698(84)80005-0zbMath0551.05056MaRDI QIDQ801089
Publication date: 1984
Published in: European Journal of Combinatorics (Search for Journal in Brave)
05A05: Permutations, words, matrices
05B35: Combinatorial aspects of matroids and geometric lattices
05C75: Structural characterization of families of graphs
Related Items
Improved bounds for colouring circle graphs, A tight relation between series-parallel graphs and bipartite distance hereditary graphs, The complexity of colouring circle graphs, 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, Isotropic matroids. II: Circle graphs, 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, A characterization of circle graphs in terms of multimatroid representations, Structural results on circular-arc graphs and circle graphs: a survey and the main open problems, Circle graph obstructions under pivoting
Cites Work