Circle graph obstructions under pivoting

DOI10.1002/jgt.20363zbMath1207.05189OpenAlexW4241335985MaRDI QIDQ3633003

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

zbMATH Keywords

delta-matroidspivotingcircle graphsEulerian delta-matroidspivot minorsprincipally unimodular matrices

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)

Related Items

Intertwining Connectivities for Vertex-Minors and Pivot-Minors ⋮ 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 ⋮ 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 ⋮ Prime vertex-minors of a prime graph ⋮ Partial characterizations of circle graphs ⋮ Structural results on circular-arc graphs and circle graphs: a survey and the main open problems ⋮ Practical and efficient circle graph recognition ⋮ The average cut-rank of graphs ⋮ Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors ⋮ Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm ⋮ Diamond-free circle graphs are Helly circle ⋮ On graphs and codes preserved by edge local complementation ⋮ The excluded 3-minors for vf-safe delta-matroids ⋮ Unavoidable vertex-minors in large prime graphs ⋮ The complexity of the vertex-minor problem ⋮ Matroids, delta-matroids and embedded graphs ⋮ Forbidden induced subgraph characterization of circle graphs within split graphs

Cites Work

• A characterization of circle graphs
• Unimodularity and circle graphs
• Graphic presentations of isotropic systems
• Decomposition of regular matroids
• Circle graph obstructions
• Graph minors. XVI: Excluding a non-planar graph
• Rank-width and vertex-minors
• Matroids and Graphs
• Greedy algorithm and symmetric matroids
• Dissections and Intertwinings of Graphs