Pages that link to "Item:Q1010945"
From MaRDI portal
The following pages link to Clique-width and the speed of hereditary properties (Q1010945):
Displaying 13 items.
- Locally bounded coverings and factorial properties of graphs (Q412246) (← links)
- On factorial properties of chordal bipartite graphs (Q442348) (← links)
- Implicit representations and factorial properties of graphs (Q472962) (← links)
- Faster recognition of clique-Helly and hereditary clique-Helly graphs (Q2379939) (← links)
- Infinitely many minimal classes of graphs of unbounded clique-width (Q2413975) (← links)
- Linear Clique‐Width for Hereditary Classes of Cographs (Q2978187) (← links)
- Boundary Properties of Factorial Classes of Graphs (Q4982282) (← links)
- Deciding the Bell number for hereditary graph properties (Q5890662) (← links)
- The structure and the number of \(P_7\)-free bipartite graphs (Q5915828) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- The structure and the number of \(P_7\)-free bipartite graphs (Q5920066) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)
- Small but unwieldy: a lower bound on adjacency labels for small classes (Q6631355) (← links)