Proceedings of the Louisiana Conference on Combinatorics, Graph Theory, and Computing, Issue 2Utilitas Mathematica Pub., 1971 - Combinatorial analysis |
Other editions - View all
Common terms and phrases
A₁ adjacent algorithm Amer array BIBD block C₁ cardinality cells characterization circuit Cmax co-circuit Combinatorial conjecture connected matroid construction contains Corollary cycle d-arrangement D₁ D₂ defined deleting denote diagonal steps disjoint distinct eigenvalues equations equivalence class exists finite given graph G Graph Theory H is flexible H₂ Harary Hence induction integer isomorphic K₂ l-cycles left-decap Lemma Let G Let H line graph line isomorphisms loops M-circuit Math matrix minimally 2-connected graphs minimally strong digraphs obtained odd degreed pair pairwise balanced design pancyclic planar planar graph plane points prime problem Proof Proposition pseudographs RBPD Room square S₂ Schur theorem simple path insertion spline Steiner triple systems subarray subgraph subset Suppose symbols symmetric symmetric difference Theorem triple systems University of Waterloo valency values vertex vertices W. T. Tutte weighted lattice weighted lattice paths zonotopes