Pages that link to "Item:Q417995"

The following pages link to Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995):

Displaying 22 items.

• Vertex coloring of graphs with few obstructions (Q344868) (← links)
• Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
• On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
• Polynomial cases for the vertex coloring problem (Q666663) (← links)
• Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
• Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
• On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
• 4-coloring \(H\)-free graphs when \(H\) is small (Q1759872) (← links)
• Sparse regular induced subgraphs in \(2P_3\)-free graphs (Q1799386) (← links)
• Triangle-free \(2P_3\)-free graphs are 4-colorable (Q1939592) (← links)
• List coloring in the absence of a linear forest (Q2258070) (← links)
• Colouring square-free graphs without long induced paths (Q2323345) (← links)
• Colouring diamond-free graphs (Q2402373) (← links)
• Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
• List coloring in the absence of two subgraphs (Q2636800) (← links)
• 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← 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)
• Coloring Graphs without Short Cycles and Long Induced Paths (Q3088283) (← links)
• List Coloring in the Absence of a Linear Forest (Q3104770) (← links)
• Colouring square-free graphs without long induced paths. (Q3304134) (← links)
• On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model (Q6131191) (← links)