Graph Coloring And Computational Complexity

← Back to Domain-Specific Abstractions by Domain

1 domain-specific abstractions whose origin domain is Graph Coloring And Computational Complexity.

• Monochromatic triangle — The graph decision problem of coloring or partitioning edges with a fixed number of colors so that no triangle has all three edges of one color.