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.
Als Gurte werden im Beton-, Holz- und Stahlbau die oberen und unteren Bänder eines Trägers mit „I-förmigem“ Querschnitt bezeichnet, die von einem durchgehenden Steg auf Abstand gehalten werden.
Preferred languages to be displayed in the selection menus
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