Reconnaissance des graphes de cordes
From MaRDI portal
Publication:1059643
DOI10.1016/0012-365X(85)90117-7zbMath0567.05033MaRDI QIDQ1059643
Publication date: 1985
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On edge transitivity of directed graphs, Notes on a theorem of Naji, 2-nested matrices: towards understanding the structure of circle graphs, Unimodularity and circle graphs, A proof of a circle graph characterization, Reducing prime graphs and recognizing circle graphs, Bipartite complements of circle graphs, Intersection Graphs of Rays and Grounded Segments, The complexity of colouring circle graphs, The combinatorics of a tree-like functional equation for connected chord diagrams, The number of quasi-trees in fans and wheels, Digraph Decompositions and Eulerian Systems, Partial characterizations of circle graphs, A characterization of unimodular orientations of simple 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, Practical and efficient circle graph recognition, Representations of graphs and networks (coding, layouts and embeddings), Diamond-free circle graphs are Helly circle, Cyclic orders, Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search, Splitting cubic circle graphs, Isotropic matroids. II: Circle graphs, A characterization of circle graphs in terms of multimatroid representations, Unavoidable vertex-minors in large prime graphs, Unnamed Item, Bipartite graphs that are not circle graphs, Forbidden induced subgraph characterization of circle graphs within split graphs
Cites Work
