Pages that link to "Item:Q3788053"
From MaRDI portal
The following pages link to Transforming trees by successive local complementations (Q3788053):
Displaying 24 items.
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Recognizing locally equivalent graphs (Q685658) (← links)
- Isotropic matroids. I: Multimatroids and neighborhoods (Q727168) (← links)
- Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- From graph states to two-graph states (Q1009039) (← links)
- Treelike comparability graphs (Q1026130) (← links)
- Isotropic systems (Q1101116) (← links)
- Transitivity of local complementation and switching on graphs. (Q1427469) (← links)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Distance-hereditary comparability graphs (Q1759843) (← links)
- The average cut-rank of graphs (Q2225395) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Graphs of small rank-width are pivot-minors of graphs of small tree-width (Q2442212) (← links)
- Rank-width and vertex-minors (Q2565688) (← links)
- Distance-Hereditary Comparability Graphs (Q2840542) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- Matroids that classify forests (Q5047015) (← links)
- A polynomial kernel for distance-hereditary vertex deletion (Q5918311) (← links)
- Graphs with bounded induced distance (Q5928866) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
