Pages that link to "Item:Q1356726"
From MaRDI portal
The following pages link to The complexity of \(G\)-free colourability (Q1356726):
Displaying 6 items.
- Partitions of graphs into cographs (Q607000) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions (Q721942) (← links)
- (Q5009615) (← links)
- Some bounds on the size of maximum G-free sets in graphs (Q6174763) (← links)
- Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)
