Local complementation and interlacement graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3480634 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3552534 (Why is no real title available?)
- scientific article; zbMATH DE number 3588700 (Why is no real title available?)
- scientific article; zbMATH DE number 3606473 (Why is no real title available?)
- scientific article; zbMATH DE number 3641498 (Why is no real title available?)
- On the Principal Edge Tripartition of a Graph
Cited in
(19)- A few words about maps
- Graphes de cordes et espaces graphiques
- Excluding a bipartite circle graph from line graphs
- Edge local complementation and equivalence of binary linear codes
- On distance-\(d\) Independent Set and other problems in graphs with ``few minimal separators
- Edge local complementation for logical cluster states
- A proof of a circle graph characterization
- Notes on a theorem of Naji
- A characterization of circle graphs
- Isotropic matroids. II: Circle graphs
- An equivalence between the set of graph-knots and the set of homotopy classes of looped graphs
- Rank-width: algorithmic and structural results
- Unimodularity and circle graphs
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs
- On graphs and codes preserved by edge local complementation
- Interlace polynomials: enumeration, unimodality and connections to codes
- Vertex-minors of graphs: a survey
- Excluded minors and the ribbon graphs of knots
- Circle graph isomorphism in almost linear time
This page was built for publication: Local complementation and interlacement graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1146681)
