Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03614309n
Noun Concept
Categories: Perfect graphs, Intersection classes of graphs, Graph families
EN
chordal graph  chordal  Chord  Decomposable graph  Dirac's theorem on chordal graphs
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
Definitions
Relations
Sources
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
graph family Wikidata
IS A
perfect graph
HAS KIND
trivially perfect graph
block graph
strongly chordal graph
k-tree
HAS INSTANCE
Goldner–Harary graph
STUDIED BY
graph theory
Wikipedia
EN
chordal graph
Wikidata
EN
chordal graph
Wikipedia Redirections
EN
Chord (graph theory), chordal, Decomposable graph, Dirac's theorem on chordal graphs, max-cardinality ordering, perfect elimination ordering, subtree graph, Triangulated graph

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