Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03640657n
Noun Concept
Categories: Graph families
EN
triangle-free graph  triangle-free  triangle finding problem
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
Definitions
Relations
Sources
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
Undirected graph in which no three vertices form a triangle of edges Wikidata
IS A
undirected graph
HAS KIND
caterpillar tree
Mycielskian
Andrásfai graph
HAS INSTANCE
Wagner graph
Chvátal graph
Harries graph
Harries–Wong graph
Franklin graph
+8 relations
STUDIED BY
graph theory
Wikipedia
EN
triangle-free graph
Wikidata
EN
triangle-free graph
Wikipedia Redirections
EN
triangle-free, triangle finding problem

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