The following pages link to Perfectness of clustered graphs (Q1799385):
Displaying 6 items.
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- Cluster expansion formulas and perfect matchings (Q610448) (← links)
- Clustering and domination in perfect graphs (Q1068110) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- A note on selective line-graphs and partition colorings (Q2294381) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)