Pages that link to "Item:Q1613477"

The following pages link to Three-colourability and forbidden subgraphs. II: Polynomial algorithms (Q1613477):

Displaying 32 items.

• 4-colorability of \(P_6\)-free graphs (Q322185) (← links)
• Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
• Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
• First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
• 3-colorability and forbidden subgraphs. I: Characterizing pairs (Q1422435) (← links)
• 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← links)
• Triangle-free graphs and forbidden subgraphs (Q1613361) (← links)
• Triangle-free graphs with no six-vertex induced path (Q1637133) (← links)
• Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)
• Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
• Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
• Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
• On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets (Q2064297) (← links)
• Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
• Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
• Coloring vertices of claw-free graphs in three colors (Q2251141) (← links)
• Obstructions for three-coloring graphs without induced paths on six vertices (Q2284725) (← links)
• The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
• On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
• NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
• On the complexity of 4-coloring graphs without long induced paths (Q2465649) (← links)
• The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
• 4‐Coloring <i>P</i> ₆ ‐Free Graphs with No Induced 5‐Cycles (Q2978175) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
• Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
• Independent Feedback Vertex Set for P_5-free Graphs (Q5136232) (← links)
• Colouring graphs with no induced six-vertex path or diamond (Q5925590) (← links)
• Colouring graphs with no induced six-vertex path or diamond (Q5972261) (← links)
• An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)
• Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs (Q6143379) (← links)