Pages that link to "Item:Q2414471"

The following pages link to Certifying coloring algorithms for graphs without long induced paths (Q2414471):

Displaying 10 items.

• Critical \((P_6, \mathrm{banner})\)-free graphs (Q1732108) (← links)
• \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
• \(k\)-critical graphs in \(P_5\)-free graphs (Q5925505) (← links)
• A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs (Q6039897) (← links)
• Vertex-critical \((P_5, \mathrm{chair})\)-free graphs (Q6069143) (← links)
• Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs (Q6121915) (← links)
• Critical (\(P_5\), bull)-free graphs (Q6157414) (← links)
• Some results on \(k\)-critical \(P_5\)-free graphs (Q6157421) (← links)
• Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs (Q6180578) (← links)
• Critical \((P_5,\mathit{dart})\)-free graphs (Q6606249) (← links)