Pages that link to "Item:Q2816134"

The following pages link to 3-colourability and forbidden subgraphs (Q2816134):

Displaying 12 items.

• 3-colorability and forbidden subgraphs. I: Characterizing pairs (Q1422435) (← links)
• Three-colourability and forbidden subgraphs. II: Polynomial algorithms (Q1613477) (← links)
• Three forbidden subgraphs for line graphs (Q1613508) (← links)
• Three colorability characterized by shrinking of locally connected subgraphs into triangles (Q1708265) (← links)
• Forbidden triples generating a finite set of graphs with minimum degree three (Q2166238) (← links)
• On Turán's \((3,4)\)-problem with forbidden subgraphs (Q2341979) (← links)
• Strict colourings of STS(\(3v\))s and uncolourable BSTS(\(3v\))s (Q2569933) (← links)
• Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge (Q2665958) (← links)
• 3-colorability \(\in\mathrm{P}\) for \(P_{6}\)-free graphs (Q2816040) (← links)
• (Q3487434) (← links)
• Colouring Graphs with Prescribed Induced Cycle Lengths (Q4542873) (← links)
• 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs (Q5264756) (← links)