Excluding a bipartite circle graph from line graphs

DOI10.1002/jgt.20353zbMath1215.05175OpenAlexW4230829651MaRDI QIDQ3608319

Sang-il Oum

Publication date: 4 March 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.585.9814

zbMATH Keywords

line graphtree-widthpivot-minorrank-widthcircle graphgraphic delta-matroid

Mathematics Subject Classification ID

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

Related Items

Rank-width: algorithmic and structural results ⋮ The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor ⋮ Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions ⋮ Practical and efficient circle graph recognition ⋮ Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors ⋮ Diamond-free circle graphs are Helly circle ⋮ Scattered Classes of Graphs ⋮ Characterizing matroids whose bases form graphic delta-matroids ⋮ The grid theorem for vertex-minors ⋮ Tree Pivot-Minors and Linear Rank-Width

Cites Work

• Local complementation and interlacement graphs
• Graph minors. X: Obstructions to tree-decomposition
• Generalizations of line graphs and applications
• Circle graph obstructions
• Quickly excluding a planar graph
• Directed tree-width
• Upper bounds to the clique width of graphs
• Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
• Line graphs of bounded clique-width
• Approximating clique-width and branch-width
• An interrelation between line graphs, eigenvalues, and matroids
• Rank-width and vertex-minors
• The branchwidth of graphs and their cycle matroids
• Greedy algorithm and symmetric matroids