Pages that link to "Item:Q1302156"
From MaRDI portal
The following pages link to On the extension of bipartite to parity graphs (Q1302156):
Displayed 8 items.
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way (Q3010409) (← links)