Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 14Utilitas Mathematica Pub, 1983 - Combinatorial analysis |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
Pomeranee | 21 |
J Abrham A Kotzig and P J Laufer | 45 |
B A Anderson | 75 |
Copyright | |
16 other sections not shown
Other editions - View all
Common terms and phrases
2-extensors adjacent algorithm array assume bifactorization binary blocks cograph color column Combinatorial complete graph component Computing configuration CONGRESSUS NUMERANTIUM conjecture consider construction contains Corollary corresponding cosets cycle cyclic defined denote determine digraph directed graph disjoint distance edge of H elements embedded Eulerian circuit example exists Figure finite function given Goppa codes graph G Graph Theory Hence hypergraph idempotent implies induced subgraph inequalities integer intersection irreducible isomorphic k-subset Ker G labelled latin squares Lemma length Let G linear mapping Math Mathematics matrix matroid maximal maximum minimal minimum mission network nodes NP-complete obtained operations pair paper partition path perfect graphs permutation plane polynomial problem Proof prove PSDS quasigroup randomly bitraceable result satisfying sequence Southeastern Conference subgraph subset Suppose symmetric Theorem tiles tree triangle upper bound values variables vector vertex vertices
Bibliographic information
| Title | Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 14 Volume 17 of Congressus numerantium |
| Publisher | Utilitas Mathematica Pub, 1983 |
| Original from | the University of California |
| Digitized | Jan 7, 2011 |
| ISBN | 0919628397, 9780919628397 |
| Export Citation | BiBTeX EndNote RefMan |