Excluding a bipartite circle graph from line graphs
From MaRDI portal
Publication:3608319
Recommendations
Cites work
- An interrelation between line graphs, eigenvalues, and matroids
- Approximating clique-width and branch-width
- Circle graph obstructions
- Directed tree-width
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- Generalizations of line graphs and applications
- Graph minors. X: Obstructions to tree-decomposition
- Greedy algorithm and symmetric matroids
- Line graphs of bounded clique-width
- Local complementation and interlacement graphs
- Quickly excluding a planar graph
- Rank-width and vertex-minors
- The branchwidth of graphs and their cycle matroids
- Upper bounds to the clique width of graphs
Cited in
(13)- The grid theorem for vertex-minors
- Tree pivot-minors and linear rank-width
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
- scientific article; zbMATH DE number 475621 (Why is no real title available?)
- Scattered classes of graphs
- Practical and efficient circle graph recognition
- Tree pivot-minors and linear rank-width
- Rank-width: algorithmic and structural results
- Diamond-free circle graphs are Helly circle
- Characterizing matroids whose bases form graphic delta-matroids
- Vertex-minors of graphs: a survey
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
This page was built for publication: Excluding a bipartite circle graph from line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608319)