Proceedings of the ... Southeastern Conference on Combinatorics, Graph Theory, and Computing, Part 2Utilitas Mathematica Pub., 1981 - Combinatorial analysis |
Other editions - View all
Common terms and phrases
9max adjacent algorithm antichain antimatroid antimatroid graph b₁ block graphs C₁ chordal graphs chromatic number classes color Combinatorics complete graph Computing Conference on Combinatorics CONGRESSUS NUMERANTIUM conjecture connected construction contains convex Corollary critical graph cubic graphs defined degree 2 cell denote disjoint distance degree sequence elements embedding endpoint Euler cycle example exists face graph Figure finite G₁ G₂ genus given graph G Graph Theory Group H₁ H₂ Hamiltonian Hence hub cell hypergraph induction integer interval order irreducible ISBN isomorphic k-tree labelling Lemma length Let G linear little hub m-labelling Math matrices maximal networks nodes nonorientable obtained orientable packed pairs partial order partition function path permutation points positive integer problem Proof proved quadruple systems query graph recursive result Southeastern Conference subgraph subset Suppose Theorem tight cell tight set trees triangle University V₁ V₂ vertex vertices