Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 23Utilitas Mathematica Pub, 1992 - Combinatorial analysis |
Other editions - View all
Common terms and phrases
algorithm array assume automorphism bandwidth block Boolean cell chord clique codes color column Combinatorial comparability graph complete mappings components connected construction contains contradiction Corollary corresponding cycle defined denote digraph disjoint maximum independent dominating set elements exists extend to disjoint face configuration fault pattern finite fractional coloring G₁ G₂ given graph G Graph Theory Halin graph Hamilton path Hamiltonian Hamiltonian path Hence induced subgraph isomorphic labels Lemma Let G linear lower bound Math matrix maximal maximum independent sets minimal minimum nodes NP-complete number of edges obtained optimal P₁ pair pairable partition permutation graphs planar graph points polynomial positive integer problem Proof RCCC result sequence sets in G spanners spanning tree square strongly preserves subset subtree Suppose t-spanner Theorem Traveling Classes u₁ unate function V₁ V₂ vector vertex vertex of degree visibility graph weight