Live briefing
Everything about Triangle graph
In the mathematical field of graph theory, the triangle graph is a planar undirected graph with 3 vertices and 3 edges, in the form of a triangle. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Triangle graphA 5-minute orientation
- Skim a recent paper: Phase transitions in the Ising model on a hierarchical random graph based on the triangleInfluential work since 2022
- Pick up a classic book: Obobshchennye treugolʹniki i piramidy Paskali͡a︡, ikh fraktali, grafy i prilozhenii͡a︡The most-reprinted book on the subject
- Read the landmark paper: VVA triangle graph ambiguities in four and N dimensionsCited 32 times
- Go sideways: MycielskianA closely related topic
- Go sideways: Diamond graphA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
VVA triangle graph ambiguities in four and N dimensions
The smallest triangle-free 4-chromatic 4-regular graph
Para‐Graph: Graph‐Based Parameterization of Triangle Meshes with Arbitrary Genus
A triangle-free circle graph with chromatic number 5
Graph clustering using triangle-aware measures in large networks
Triangle Counting in Dynamic Graph Streams
The Ramsey theory of the universal homogeneous triangle-free graph
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream
🆕 Influential since 2022
Phase transitions in the Ising model on a hierarchical random graph based on the triangle
Structured encryption for triangle counting on graph data
Decomposing a triangle-free planar graph into a forest and a subcubic forest
Exponential random graph models and pendant-triangle statistics
Note on the sum of the smallest and largest eigenvalues of a triangle-free graph
📚 Books worth reading
- 📕Obobshchennye treugolʹniki i piramidy Paskali͡a︡, ikh fraktali, grafy i prilozhenii͡a︡B. A. Bondarenko · 1990
- 📕Deng zhou wen tiZongxi Cai · 2002
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Mycielskian In the mathematical area of graph theory, the Mycielskian or Mycielski graph of an undirected graph is a larger graph formed from it by a construction…
- Diamond graph In the mathematical field of graph theory, the diamond graph is a planar, undirected graph with 4 vertices and 5 edges. It consists of a complete graph…
- Chvátal graph In the mathematical field of graph theory, the Chvátal graph is an undirected graph with 12 vertices and 24 edges, discovered by Václav Chvátal in 1970…
- Bull graph In the mathematical field of graph theory, the bull graph is a planar undirected graph with 5 vertices and 5 edges, in the form of a triangle with two…
- Clebsch graph In the mathematical field of graph theory, the Clebsch graph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and…
- 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…
- Tutte polynomial The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graph polynomial. It is a polynomial in two variables which plays…
- Brinkmann graph In the mathematical field of graph theory, the Brinkmann graph is a 4-regular graph with 21 vertices and 42 edges discovered by Gunnar Brinkmann in 1992…