The following pages link to (Q3558598):
Displaying 8 items.
- Strong cliques in diamond-free graphs (Q5919069) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5925681) (← links)
- A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs (Q6039897) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
- Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs (Q6121915) (← links)
- Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs (Q6180578) (← links)
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)
- A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)
