The following pages link to Twin-width II: small classes (Q5051371):
Displaying 15 items.
- Bounds for the Twin-Width of Graphs (Q5043639) (← links)
- Twin-width I: Tractable FO Model Checking (Q5066940) (← links)
- Twin-width can be exponential in treewidth (Q6038574) (← links)
- Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded (Q6038594) (← links)
- Neighbourhood complexity of graphs of bounded twin-width (Q6081102) (← links)
- Functionality of box intersection graphs (Q6140059) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Graph parameters, implicit representations and factorial properties (Q6172309) (← links)
- Small but unwieldy: a lower bound on adjacency labels for small classes (Q6631355) (← links)
- Twin-width. III: Max independent set, min dominating set, and coloring (Q6631356) (← links)
- Twin-width of random graphs (Q6641067) (← links)
- Treelike decompositions for transductions of sparse graphs (Q6649461) (← links)
- Stable graphs of bounded twin-width (Q6649471) (← links)
- Model checking on interpretations of classes of bounded local cliquewidth (Q6649489) (← links)
- Twin-width of graphs with tree-structured decompositions (Q6671382) (← links)
