Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 13Utilitas Mathematica Pub, 1982 - Combinatorial analysis |
Contents
P Erdős | 3 |
A F Alameddine | 19 |
Alexander G Hopkins and W Staton | 33 |
Copyright | |
35 other sections not shown
Other editions - View all
Common terms and phrases
4-trees 5-vertices adjacency matrix adjacent algorithm array assignment assume binary tree bipartite blocks Bruijn sequence called carrier coloring Combinatorics common neighbor Computing Conference on Combinatorics CONGRESSUS NUMERANTIUM consider construction contains Corollary corresponding cost d₁ D₂ defined denote DIEGO digraph disk distance elements embedding exactly example exists Figure finite function G₁ given graceful graph G Graph Theory Hence hypercodes hypergraph implies impossible paths interval graph ISBN isomorphic L₁ labelling latin square least Lemma Let G linear maps Math Mathematics matrix minimum NLFSR node Note NP-complete obtained outerplanar graphs pair partition permutation planar planar graphs polynomial problem Proof prove quadrangle quasigroup random graph result Room square shipper Southeastern Conference span Steiner tree subgraph subsets subsquare Suppose Theorem tolerance graph triangle-free graph truth table unique University values vertex vertices of degree wrapped covering