Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Part 2Utilitas Mathematica Pub., 1980 - Combinatorial analysis |
Contents
Hedetniemi and S T Hedetniemi | 3 |
Hobbs and A Kotzig | 35 |
Holliday | 57 |
Copyright | |
15 other sections not shown
Other editions - View all
Common terms and phrases
2-extensors adjacent algorithm binary bipartite graph blocks cell CFRAC chromatic color column Combinatorial complete graph Computing CONGRESSUS NUMERANTIUM Conjecture construction contains original research Corollary corresponding cosets cycle cyclic defined denote edges elements embedded example exists factor Figure finite friendship graph function G₁ G₂ gas-stations Goppa codes graph G Graph Theory graphic primitives Hence infinite integer intersection irreducible ISBN iterative k-subsets Ker G labelled latin squares Lemma Let G lexicographic order linear Manitoba Math Mathematics matrix matroid maximum method minimum number nodes NP-complete number of vertices obtained ochromatic number OPT G orbits pairs paper contains original parallel parent array partition permutations points polynomial problem Proof published elsewhere quasiperfect recursive result ring root Southeastern Conference Stirling polynomials subgraph symmetric Theorem tiles tree University of Manitoba upper bound vector vertex X⁰