| 
|
Quote: an undirected graph without self-loops is chordal iff it has a simplicial elimination ordering
Topic:
graphs
Quotation Skeleton
A graph is chordal if every cycle with … the cycle but which connects two vertices of … … [p. 318] "Theorem 1. (Dirac []) An undirected graph … [Dirac, G.A., abhandlungen aus dem Mathematischen Seminar der Universiat Hamburg, 25:71-75, 1961]. Google-1 Google-2
Copyright clearance needed for quotation.
Topic: graphs (18 items)