Pages that link to "Item:Q5310655"
From MaRDI portal
The following pages link to The monadic second-order logic of graphs XVI : Canonical graph decompositions (Q5310655):
Displaying 9 items.
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- On the treewidth of dynamic graphs (Q744102) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
