The following pages link to The bi-join decomposition (Q3439330):
Displaying 6 items.
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- Switching to Hedgehog-Free Graphs Is NP-Complete (Q3010425) (← links)
- On Switching to <i>H</i>‐Free Graphs (Q5417832) (← links)
- A Representation Theorem for Union-Difference Families and Application (Q5458554) (← links)