<span class="searchmatch">triangle</span> + -<span class="searchmatch">free</span>. <span class="searchmatch">triangle</span>-<span class="searchmatch">free</span> (not comparable) (graph theory) Of an undirected graph in which no three vertices form a <span class="searchmatch">triangle</span> of edges. <span class="searchmatch">Triangle</span>-free...
sternocostal <span class="searchmatch">triangle</span> Sunni <span class="searchmatch">Triangle</span> superior carotid <span class="searchmatch">triangle</span> tangential <span class="searchmatch">triangle</span> time <span class="searchmatch">triangle</span> <span class="searchmatch">triangle</span> choke <span class="searchmatch">triangle</span>-<span class="searchmatch">free</span> <span class="searchmatch">triangle</span> group <span class="searchmatch">triangle</span> inequality...
sulphur-free tax-<span class="searchmatch">free</span> tinfree toll-<span class="searchmatch">free</span> touch-<span class="searchmatch">free</span> touchfree traffic-<span class="searchmatch">free</span> <span class="searchmatch">triangle</span>-<span class="searchmatch">free</span> trouble-<span class="searchmatch">free</span> troublefree twistfree value-<span class="searchmatch">free</span> visa-<span class="searchmatch">free</span> water-<span class="searchmatch">free</span> waterfree...
A <span class="searchmatch">triangle</span>-<span class="searchmatch">free</span> graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is a member of an infinite sequence of <span class="searchmatch">triangle</span>-<span class="searchmatch">free</span> graphs...
rectangle + graph rectagraph (plural rectagraphs) (graph theory) A <span class="searchmatch">triangle</span>-<span class="searchmatch">free</span> connected graph where any two vertices have 0 or 2 common neighbors...
published a proof in 1959. Grötzsch's theorem (graph theory) The statement that every <span class="searchmatch">triangle</span>-<span class="searchmatch">free</span> planar graph has a coloring using only three colors....
undirected graph by a particular construction that preserves the property of being <span class="searchmatch">triangle</span>-<span class="searchmatch">free</span> but increases the chromatic number. Synonym: Mycielski graph...
are also called 'negative' shapes and are found between the positive shapes – in this case, the rectangles, <span class="searchmatch">triangles</span>, circles and freeforms. <span class="searchmatch">free</span>-from...
three angles of a spherical <span class="searchmatch">triangle</span> exceeds two right angles. The spherical excess is proportional to the area of the <span class="searchmatch">triangle</span>. Part or all of this entry...
(not comparable) Having a cross section in the form of an equilateral <span class="searchmatch">triangle</span>; said especially of a kind of file. Part or all of this entry has been...