Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03614309n
Noun Concept
SYL
No term available
EN
In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not part of the cycle but connects two vertices of the cycle. Wikipedia
Relations
Sources
IS A
EN
perfect graph
HAS KIND
EN
trivially perfect graph
EN
block graph
EN
strongly chordal graph
EN
k-tree
HAS INSTANCE
EN
Goldner–Harary graph
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