Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03640657n
Noun Concept
SYL
No term available
EN
In the mathematical area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges. Wikipedia
Relations
Sources
IS A
EN
undirected graph
HAS KIND
EN
caterpillar tree
EN
Mycielskian
EN
Andrásfai graph
HAS INSTANCE
EN
Wagner graph
EN
Chvátal graph
EN
Harries graph
EN
Harries–Wong graph
EN
Franklin graph
+8 relations
STUDIED BY
EN
graph theory

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License