Local complementation and interlacement graphs

DOI10.1016/0012-365X(81)90255-7zbMath0448.05024MaRDI QIDQ1146681

Hubert de Fraysseix

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

binary matroidplanar graphinterlacement graphchord intersection graphcircuit spacecocircuit space

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (17)

A tight relation between series-parallel graphs and bipartite distance hereditary graphs ⋮ On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators ⋮ Notes on a theorem of Naji ⋮ Unimodularity and circle graphs ⋮ A proof of a circle graph characterization ⋮ Rank-width: algorithmic and structural results ⋮ Circle graph isomorphism in almost linear time ⋮ Edge local complementation for logical cluster states ⋮ Interlace polynomials: enumeration, unimodality and connections to codes ⋮ On graphs and codes preserved by edge local complementation ⋮ Excluding a bipartite circle graph from line graphs ⋮ Isotropic matroids. II: Circle graphs ⋮ Excluded Minors and the Ribbon Graphs of Knots ⋮ Edge local complementation and equivalence of binary linear codes ⋮ AN EQUIVALENCE BETWEEN THE SET OF GRAPH-KNOTS AND THE SET OF HOMOTOPY CLASSES OF LOOPED GRAPHS ⋮ Graphes de cordes et espaces graphiques ⋮ A characterization of circle graphs

Cites Work

• On the Principal Edge Tripartition of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Local complementation and interlacement graphs