What people are saying - Write a review
We haven't found any reviews in the usual places.
11 other sections not shown
Other editions - View all
Adj(u Adj(x algorithm arcs assume bipartite graph bisimplicial characteristic vector characterization chordless chordless cycle chords circular l's property circular-arc graph clique cover clique of G color classes Combinatorics comparability graph complement complete graph consecutive l's property Corollary corresponding cycle data structure decomposition defined denote derived graph dimension Discrete Math endpoint equivalent exists Fulkerson Golumbic graph G graph in Figure Graph Theory implication class implies induced subgraph integer intersection graph interval graph isomorphic labeling Lemma Let G linear matroid maximal multiplex maximum clique maximum stable set n x n NP-complete obtain orientation of G p-critical graph partially ordered sets partition perfect elimination scheme perfect graph conjecture permutation graph posets problem Proof Prove the following queue Section semiorder set of G simplex split graph subset subtrees superperfect Theorem threshold graph to(G transitive orientation tree triangulated graph Trotter undirected graph Univ vertices of G