All-Edges Monochromatic Triangle

Given an $n$ -node graph in which each edge has a color from $1$ to $n^2$ , decide for each edge whether it belongs to a monochromatic triangle, a triangle whose all three edges have the same color.

Parameters

$n$ : number of nodes
$m$ : number of edges
$k$ : number of colors

Related Problems

Exact Triangle2
- Real Exact Triangle
- All-Edges Exact Triangle1
- - Real All-Edges Exact Triangle1
  - #Real All-Edges Exact Triangle

Triangle Detection6
- Negative Triangle Detection1
- - Negative Triangle Search1
  - Negative Triangle Listing
- Nondecreasing Triangle
- Minimum Triangle
- Triangle in Unweighted Graph
- Triangle Listing
- Triangle Collection*

Edge Triangle Detection

Edge Triangle Counting

Vertex Triangle Listing

Dynamic Vertex Triangle Listing

Triangle Collection

All-Color-Pairs Triangle Collection*

All-Color-Pairs Triangle Collection

$\Delta$ -Matching Triangles

All-Edges Monochromatic Triangle1
- #All-Edges Monochromatic Triangle

Minimum Weight Triangle

Combinatorial Triangle Detection

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 8 of 8 reductions


Real 3SUM	All-Edges Monochromatic Triangle	2022
Real Exact Triangle	All-Edges Monochromatic Triangle	2022
APSP on Directed Graphs with Real-Valued Weights	All-Edges Monochromatic Triangle	2022
All-Edges Monochromatic Triangle	All-Color-Pairs Triangle Collection*	2022
Edge Triangle Detection	All-Edges Monochromatic Triangle	2022
All-Edges Monochromatic Triangle	All-Edges Exact Triangle	2022
3SUM	All-Edges Monochromatic Triangle	2020
All-Edges Monochromatic Triangle	Edge Triangle Detection	2020

Other relevant algorithms

Insuffient Data to display table