Circle graph obstructions under pivoting
From MaRDI portal
Recommendations
Cites work
- A characterization of circle graphs
- Circle graph obstructions
- Decomposition of regular matroids
- Dissections and Intertwinings of Graphs
- Graph minors. XVI: Excluding a non-planar graph
- Graphic presentations of isotropic systems
- Greedy algorithm and symmetric matroids
- Matroids and Graphs
- Rank-width and vertex-minors
- Unimodularity and circle graphs
Cited in
(33)- Bipartite graphs that are not circle graphs
- Circle graph obstructions
- Bridge obstructions to circular-three gate matrix layout
- The excluded 3-minors for vf-safe delta-matroids
- The complexity of the vertex-minor problem
- Forbidden induced subgraph characterization of circle graphs within split graphs
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- 2-nested matrices: towards understanding the structure of circle graphs
- The average cut-rank of graphs
- On graphs and codes preserved by edge local complementation
- Matroids, delta-matroids and embedded graphs
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Excluding a bipartite circle graph from line graphs
- scientific article; zbMATH DE number 1933269 (Why is no real title available?)
- Practical and efficient circle graph recognition
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
- Intertwining Connectivities for Vertex-Minors and Pivot-Minors
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
- A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors
- Treewidth, Circle Graphs, and Circular Drawings
- Prime vertex-minors of a prime graph
- Partial characterizations of circle graphs
- Vertex-minors of graphs: a survey
- Tree pivot-minors and linear rank-width
- Treewidth, circle graphs and circular drawings
- Reducing 2-qubit gate count for ZX-calculus based quantum circuit optimization
- A survey of degree-boundedness
- Computing pivot-minors
- Isotropic matroids. II: Circle graphs
- Sublinear hitting sets for some geometric graphs
- Unavoidable vertex-minors in large prime graphs
- Diamond-free circle graphs are Helly circle
This page was built for publication: Circle graph obstructions under pivoting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633003)
