Pages that link to "Item:Q2636800"

The following pages link to List coloring in the absence of two subgraphs (Q2636800):

Displaying 12 items.

• A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
• A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
• Critical hereditary graph classes: a survey (Q518125) (← links)
• Towards an isomorphism dichotomy for hereditary graph classes (Q1693994) (← links)
• On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
• On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
• Colouring square-free graphs without long induced paths (Q2323345) (← links)
• The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
• Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
• Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• Colouring square-free graphs without long induced paths. (Q3304134) (← links)