Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 5Utilitas Mathematica Pub, 1974 - Combinatorial analysis |
Other editions - View all
Common terms and phrases
1-factorization 5TH S-E CONF adjacency matrix algorithm automorphism blocks bound chromatic number circuit coloring COMBINATORICS complete components COMPUTING connected graph consider construction contains coordinate Corollary corresponding cosets cubic graph cycle defined degree denote digraph disjoint edges elements exactly example exists finite functions G₁ G₂ given graph G GRAPH THEORY H₁ Hamiltonian Hence homeomorphic independence graphs independent set induced intersection graph interval graph isomorphic Latin square Lemma Let G Math matroid minimum forest n-coloring n-tuple nodes NP-complete number of vertices obtained optional points orbits pair palindrome parameters partition path permutation planar plane graph polynomial algorithm positive integers problem PROC Proof quadratic residue regular graphs result rows S₁ self-complementary self-dual codes sequence spanning tree starter strongly regular graphs subsets subsquare Suppose Theorem triple two-graph University V₁ values vector vertex weight