Pages that link to "Item:Q2097181"

The following pages link to The feasibility problem for line graphs (Q2097181):

Displaying 3 items.

• Flip colouring of graphs (Q6632145) (← links)
• Avoiding intersections of given size in finite affine spaces \(\operatorname{AG}(n,2)\) (Q6637141) (← links)
• The feasibility problem: the family \(\mathcal{F}(G)\) of all induced \(G\)-free graphs. (Q6644901) (← links)