Pages that link to "Item:Q5229535"

The following pages link to Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide (Q5229535):

Displaying 10 items.

• Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
• The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
• On easy and hard hereditary classes of graphs with respect to the independent set problem (Q1414579) (← links)
• Colouring square-free graphs without long induced paths (Q2323345) (← links)
• On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
• (Q4242799) (← links)
• (Q5111290) (← links)
• Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
• Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
• (Q5874504) (← links)