Pages that link to "Item:Q1356726"
From MaRDI portal
The following pages link to The complexity of \(G\)-free colourability (Q1356726):
Displaying 22 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)
- The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
- Subcolorings and the subchromatic number of a graph (Q1412662) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Co-bipartite neighborhood edge elimination orderings (Q1689989) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- Vertex partitions of graphs into cographs and stars (Q2874091) (← links)
- On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions (Q3196420) (← links)
- (Q5009615) (← links)
- Harary polynomials (Q5056203) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
- On 2-Subcolourings of Chordal Graphs (Q5458558) (← links)
- (Q5708621) (← links)
- Between 2- and 3-colorability (Q5902303) (← 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)
- The complexity of \((P_k, P_\ell ) \)-arrowing (Q6546595) (← links)
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets (Q6606167) (← links)
