Pages that link to "Item:Q1613361"

The following pages link to Triangle-free graphs and forbidden subgraphs (Q1613361):

Displaying 15 items.

• Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
• Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
• Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
• Chromatic bounds for the subclasses of \(pK_2\)-free graphs (Q831732) (← 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)
• \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
• On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
• Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
• Coloring Graphs without Short Cycles and Long Induced Paths (Q3088283) (← links)
• Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs (Q6098088) (← links)
• Bounds for the chromatic number of some \(pK_2\)-free graphs (Q6103479) (← links)
• Coloring (\(P_5\), kite)-free graphs with small cliques (Q6180573) (← links)