Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Monochromatic triangle
open-in-new
<p>In <a href="/facts/Graph_theory/VVPCd4TX">graph theory</a> and <a href="/facts/Theoretical_computer_science/jSkGGuvy">theoretical computer science</a>, the monochromatic triangle problem is an algorithmic problem on graphs, in which the goal is to partition the edges of a given graph into two <a href="/facts/Triangle-free_graph/8D3LJ44h">triangle-free</a> subgraphs. It is <a href="/facts/NP-complete/NFPv56DU">NP-complete</a> but <a href="/facts/Fixed-parameter_tractable/RoyaJGgJ">fixed-parameter tractable</a> on graphs of bounded <a href="/facts/Treewidth/uoITxzRJ">treewidth</a>. </p>