The following pages link to Circle graph obstructions (Q1322010):
Displaying 50 items.
- Interlacement of double curves of immersed spheres (Q282737) (← links)
- Graph-links: nonrealizability, orientation, and Jones polynomial (Q289738) (← links)
- Notes on a theorem of Naji (Q329556) (← links)
- Parity in knot theory and graph-links (Q459460) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Binary matroids and local complementation (Q482118) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- On the linear algebra of local complementation (Q665929) (← links)
- Splitting cubic circle graphs (Q726651) (← links)
- Isotropic matroids. I: Multimatroids and neighborhoods (Q727168) (← links)
- Isotropic matroids. II: Circle graphs (Q727169) (← links)
- Unavoidable vertex-minors in large prime graphs (Q740266) (← links)
- Topological realizations of ortho-projection graphs (Q842981) (← links)
- Combining overlap and containment for gene assembly in ciliates (Q847668) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Diamond-free circle graphs are Helly circle (Q965965) (← links)
- Interlace polynomials: enumeration, unimodality and connections to codes (Q968188) (← links)
- Graph theoretic approach to parallel gene assembly (Q1003730) (← links)
- On the realization of double occurrence words (Q1024503) (← links)
- On the interlace polynomials of forests (Q1045139) (← links)
- Graph-links (Q1048556) (← links)
- Bipartite graphs that are not circle graphs (Q1296144) (← links)
- Covering and coloring polygon-circle graphs (Q1356563) (← links)
- A proof of a circle graph characterization (Q1367045) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- A few weight systems arising from intersection graphs (Q1432726) (← links)
- Container ship stowage problem complexity and connection to the coloring of circle graphs (Q1570840) (← links)
- Homotopy type of circle graph complexes motivated by extreme Khovanov homology (Q1785717) (← links)
- Vertex-minors and the Erdős-Hajnal conjecture (Q1800420) (← links)
- Formal systems for gene assembly in ciliates. (Q1853740) (← links)
- The excluded 3-minors for vf-safe delta-matroids (Q2020023) (← links)
- Criteria for the height of an atom (Q2027861) (← links)
- The complexity of the vertex-minor problem (Q2059901) (← links)
- Forbidden induced subgraph characterization of circle graphs within split graphs (Q2091783) (← links)
- Subgraph complementation and minimum rank (Q2121776) (← links)
- Topology and counting of real algebraic curves (Q2149421) (← links)
- 2-nested matrices: towards understanding the structure of circle graphs (Q2152610) (← links)
- On graphs and codes preserved by edge local complementation (Q2260792) (← links)
- A characterization of circle graphs in terms of multimatroid representations (Q2290352) (← links)
- Wilson loops in terms of color invariants (Q2315791) (← links)
- Matroids, delta-matroids and embedded graphs (Q2318477) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- Isotropic matroids. III: Connectivity (Q2363112) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Formation of a giant component in the intersection graph of a random chord diagram (Q2396892) (← links)
- Interlacement and activities in delta-matroids (Q2422209) (← links)
- Obstructions for linear rank-width at most 1 (Q2442201) (← links)
