Circle graph obstructions under pivoting
From MaRDI portal
Publication:3633003
DOI10.1002/JGT.20363zbMATH Open1207.05189OpenAlexW4241335985MaRDI QIDQ3633003FDOQ3633003
Authors: Jim Geelen, Sang-Il Oum 
Publication date: 16 June 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.4931
Recommendations
pivotingcircle graphsdelta-matroidsEulerian delta-matroidspivot minorsprincipally unimodular matrices
Cites Work
- Decomposition of regular matroids
- Matroids and Graphs
- Circle graph obstructions
- Rank-width and vertex-minors
- Graphic presentations of isotropic systems
- Greedy algorithm and symmetric matroids
- Graph minors. XVI: Excluding a non-planar graph
- Unimodularity and circle graphs
- A characterization of circle graphs
- Dissections and Intertwinings of Graphs
Cited In (26)
- The average cut-rank of graphs
- Unavoidable vertex-minors in large prime 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
- The excluded 3-minors for vf-safe delta-matroids
- Intertwining Connectivities for Vertex-Minors and Pivot-Minors
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
- 2-nested matrices: towards understanding the structure of circle graphs
- Tree pivot-minors and linear rank-width
- Practical and efficient circle graph recognition
- Treewidth, Circle Graphs, and Circular Drawings
- Treewidth, circle graphs and circular drawings
- Partial characterizations of circle graphs
- Isotropic matroids. II: Circle graphs
- Prime vertex-minors of a prime graph
- Title not available (Why is that?)
- Diamond-free circle graphs are Helly circle
- The complexity of the vertex-minor problem
- On graphs and codes preserved by edge local complementation
- Vertex-minors of graphs: a survey
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
- A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- Matroids, delta-matroids and embedded graphs
- Forbidden induced subgraph characterization of circle graphs within split graphs
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
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)
