Pages that link to "Item:Q2142650"

The following pages link to A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (Q2142650):

Displaying 3 items.

• Nordhaus–Gaddum problem in terms of G-free coloring (Q6132869) (← links)
• Some bounds on the size of maximum G-free sets in graphs (Q6174763) (← links)
• Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)