What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
1’s property acyclic Adj(v adjacency sets algorithm assume bisimplicial called Chapter characterization chordal bipartite graph chordal graphs chordless cycle chords circle graphs circular-arc graphs clique cover clique matrix clique of G cograph color classes columns Combinatorics comparability graph complement complete Corollary corresponding data structure decomposition deﬁned deﬁnition denote derived graph Discrete Math endpoint equivalent example exists ﬁnd ﬁnite ﬁrst Golumbic graph G graph in Figure Graph Theory implication class implies induced subgraph integer intersection graph interval graph isomorphic labeling Lemma Let G linear maximal maximum clique maximum stable set minimal minimum multiplex NP-complete obtain orientation of G partially ordered sets partition path permutation graph polynomial problem Proc Proof Prove the following queue representation satisﬁes Section semiorder sequence SIAM simplex split graph strong perfect graph subset subtrees superperfect Theorem threshold graph tolerance graphs topological sorting transitive orientation tree triangulated graphs undirected graph Univ vertices
From Google Scholar
Prakash P Shenoy, Glenn Shafer
SL Lauritzen, N Wermuth - 1989 - The Annals of Statistics
Hans L Bodlaender - 1998 - Theoretical Computer Science
All Scholar search results »
Alan George - 1989 - SIAM Review
Algorithmic graph theory and perfect graphs, by Martin C. Golumbic ...
Algorithmic graph theory and perfect graphs
Algorithmic Graph Theory and Perfect Graphs, 57 - Elsevier
Martin Charles Golumbic
JSTOR: Algorithmic Graph Theory.
Partial characterizations of clique-perfect graphs I
Graph Theory Books
Perfect Graph -- from Wolfram mathworld
Course on Algorithmic Graph theory 2004
Algorithmic Graph Theory and Perfect Graphs - Boek - BESLIST.nl