High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! In the mathematical area of graph theory, a graph is chordal if each of its cycles of four or more nodes has a chord, which is an edge joining two nodes that are not adjacent in the cycle. An equivalent definition is that any chordless cycles have at most three nodes. Chordal graphs are a subset of the perfect graphs. They are sometimes also called triangulated graphs. A perfect elimination ordering in a graph is an ordering of the vertices of the graph such that, for each vertex v, v and the neighbors of v that occur later than v in the order form a clique. A graph is chordal if and only if it has a perfect elimination ordering (Fulkerson

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.