Search results

Results 1 – 20 of 1,773
Advanced search

Search in namespaces:

There is a page named "Triangle graph" on Wikipedia

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Thumbnail for Triangle graph
    field of graph theory, the triangle graph is a planar undirected graph with 3 vertices and 3 edges, in the form of a triangle. The triangle graph is also...
    1 KB (106 words) - 17:07, 19 August 2020
  • Thumbnail for Triangle-free graph
    area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle-free graphs may be equivalently...
    21 KB (2,524 words) - 06:22, 31 May 2024
  • Thumbnail for Nested triangles graph
    In graph theory, a nested triangles graph with n vertices is a planar graph formed from a sequence of n/3 triangles, by connecting pairs of corresponding...
    6 KB (741 words) - 16:28, 19 September 2022
  • Thumbnail for Cycle (graph theory)
    Cycle graph, a graph that consists of a single cycle Chordal graph, a graph in which every induced cycle is a triangle Directed acyclic graph, a directed...
    14 KB (1,728 words) - 03:52, 22 May 2024
  • Thumbnail for Graph coloring
    graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...
    67 KB (7,996 words) - 05:55, 18 June 2024
  • Thumbnail for Directed acyclic graph
    In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it...
    45 KB (5,628 words) - 07:48, 20 May 2024
  • Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...
    106 KB (15,667 words) - 12:01, 16 May 2024
  • Thumbnail for Sierpiński triangle
    form an undirected graph, the Hanoi graph, that can be represented geometrically as the intersection graph of the set of triangles remaining after the...
    22 KB (2,673 words) - 06:15, 2 June 2024
  • Thumbnail for Bipartite graph
    required in the graph coloring problem. In contrast, such a coloring is impossible in the case of a non-bipartite graph, such as a triangle: after one node...
    33 KB (4,087 words) - 18:25, 27 May 2024
  • The triangle graph in graph theory Triangle (musical instrument), in the percussion family Tri Angle (record label), in New York and London Triangle (band)...
    4 KB (505 words) - 16:40, 1 March 2024
  • Ternary graph)
    A ternary plot, ternary graph, triangle plot, simplex plot, or Gibbs triangle is a barycentric plot on three variables which sum to a constant. It graphically...
    13 KB (1,681 words) - 14:00, 22 April 2024
  • Thumbnail for Graph property
    In graph theory, a graph property or graph invariant is a property of graphs that depends only on the abstract structure, not on graph representations...
    9 KB (1,170 words) - 06:58, 8 October 2022
  • well, and a triangular mesh has girth 3. A graph with girth four or more is triangle-free. A cubic graph (all vertices have degree three) of girth g...
    7 KB (903 words) - 09:27, 5 June 2024
  • Thumbnail for Grötzsch graph
    In the mathematical field of graph theory, the Grötzsch graph is a triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number...
    8 KB (980 words) - 07:15, 6 December 2023
  • Thumbnail for Monochromatic triangle
    In graph theory and theoretical computer science, the monochromatic triangle problem is an algorithmic problem on graphs, in which the goal is to partition...
    4 KB (481 words) - 08:23, 6 May 2024
  • Mycielski graph)
    exist triangle-free graphs with arbitrarily large chromatic number. Let the n vertices of the given graph G be v1, v2, . . . , vn. The Mycielski graph μ(G)...
    9 KB (1,096 words) - 08:44, 24 August 2023
  • Thumbnail for Neighbourhood (graph theory)
    Turán graph is locally Turán. Every planar graph is locally outerplanar. However, not every locally outerplanar graph is planar. A graph is triangle-free...
    10 KB (1,122 words) - 08:52, 18 August 2023
  • Thumbnail for Complete graph
    In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique...
    14 KB (1,244 words) - 14:52, 27 April 2024
  • View (previous 20 | ) (20 | 50 | 100 | 250 | 500
    )