Pages that link to "Item:Q5915792"

The following pages link to Approximately coloring graphs without long induced paths (Q5915792):

Displaying 13 items.

• Coloring the hypergraph of maximal cliques of a graph with no long path (Q1412673) (← links)
• Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
• Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
• Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
• New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
• (Q4252433) (← links)
• Some results on graphs without long induced paths (Q4879162) (← links)
• Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
• Coloring graphs having few colorings over path decompositions (Q5369515) (← links)
• (Q5874504) (← links)
• Approximately coloring graphs without long induced paths (Q5915792) (← links)
• (Q5918151) (redirect page) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)