Circle graph obstructions
From MaRDI portal
Publication:1322010
DOI10.1006/jctb.1994.1008zbMath0793.05116OpenAlexW2038711832MaRDI QIDQ1322010
Publication date: 5 May 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1994.1008
Related Items (79)
Subgraph complementation and minimum rank ⋮ Isotropic matroids. III: Connectivity ⋮ Interlacement of double curves of immersed spheres ⋮ Graph-links: nonrealizability, orientation, and Jones polynomial ⋮ Topological realizations of ortho-projection graphs ⋮ Combining overlap and containment for gene assembly in ciliates ⋮ Topology and counting of real algebraic curves ⋮ Covering and coloring polygon-circle graphs ⋮ Notes on a theorem of Naji ⋮ 2-nested matrices: towards understanding the structure of circle graphs ⋮ Vertex-minors, monadic second-order logic, and a conjecture by Seese ⋮ The rank-width of edge-coloured graphs ⋮ Values of the weight system on a family of graphs that are not the intersection graphs of chord diagrams ⋮ A proof of a circle graph characterization ⋮ Formation of a giant component in the intersection graph of a random chord diagram ⋮ On Strict (Outer-)Confluent Graphs ⋮ Partial-dual polynomials and signed intersection graphs ⋮ Interlacement and activities in delta-matroids ⋮ Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete ⋮ Counting single-qubit Clifford equivalent graph states is #P-complete ⋮ Prime vertex-minors of a prime graph ⋮ The combinatorics of a tree-like functional equation for connected chord diagrams ⋮ Partial characterizations of circle graphs ⋮ Obstructions for linear rank-width at most 1 ⋮ Parity in knot theory and graph-links ⋮ An invariant of graph-links valued in graphs and an almost classification of graph-links ⋮ Induced matchings in intersection graphs. ⋮ Structural results on circular-arc graphs and circle graphs: a survey and the main open problems ⋮ Extending the Overlap Graph for Gene Assembly in Ciliates ⋮ Practical and efficient split decomposition via graph-labelled trees ⋮ A few weight systems arising from intersection graphs ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ Binary matroids and local complementation ⋮ On the linear algebra of local complementation ⋮ Mutant knots and intersection graphs ⋮ Weighted Interlace Polynomials ⋮ Circle graphs and monadic second-order logic ⋮ A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS ⋮ Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ Diamond-free circle graphs are Helly circle ⋮ Interlace polynomials: enumeration, unimodality and connections to codes ⋮ On graphs and codes preserved by edge local complementation ⋮ Distance Hereditary Graphs and the Interlace Polynomial ⋮ Multimatroids. III: Tightness and fundamental graphs ⋮ The excluded 3-minors for vf-safe delta-matroids ⋮ Chi-boundedness of graph classes excluding wheel vertex-minors ⋮ The expansion of a chord diagram and the Tutte polynomial ⋮ Criteria for the height of an atom ⋮ Homotopy type of circle graph complexes motivated by extreme Khovanov homology ⋮ Excluding a bipartite circle graph from line graphs ⋮ Splitting cubic circle graphs ⋮ Isotropic matroids. I: Multimatroids and neighborhoods ⋮ Isotropic matroids. II: Circle graphs ⋮ A characterization of circle graphs in terms of multimatroid representations ⋮ Graph theoretic approach to parallel gene assembly ⋮ Vertex-minors and the Erdős-Hajnal conjecture ⋮ Unavoidable vertex-minors in large prime graphs ⋮ Embeddings of Four-valent Framed Graphs into 2-surfaces ⋮ INTERSECTION GRAPHS FOR STRING LINKS ⋮ Circle graph obstructions under pivoting ⋮ The complexity of the vertex-minor problem ⋮ On the realization of double occurrence words ⋮ INTRODUCTION TO GRAPH-LINK THEORY ⋮ Wilson loops in terms of color invariants ⋮ Matroids, delta-matroids and embedded graphs ⋮ Container ship stowage problem complexity and connection to the coloring of circle graphs ⋮ Rank-width and vertex-minors ⋮ On the interlace polynomials of forests ⋮ AN EQUIVALENCE BETWEEN THE SET OF GRAPH-KNOTS AND THE SET OF HOMOTOPY CLASSES OF LOOPED GRAPHS ⋮ Bipartite graphs that are not circle graphs ⋮ Graph-links ⋮ ON EXTREME COEFFICIENTS OF THE JONES–KAUFFMAN POLYNOMIAL FOR VIRTUAL LINKS ⋮ A BRACKET POLYNOMIAL FOR GRAPHS, I ⋮ Forbidden induced subgraph characterization of circle graphs within split graphs ⋮ TREE DIAGRAMS FOR STRING LINKS ⋮ Formal systems for gene assembly in ciliates. ⋮ Linear rank-width and linear clique-width of trees ⋮ Tree Pivot-Minors and Linear Rank-Width
This page was built for publication: Circle graph obstructions
