Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 2Utilitas Mathematica Pub - Combinatorial analysis |
Other editions - View all
Common terms and phrases
A₁ adjacent algorithm Amer array BIBD block Canad cardinality cells characterization circuit co-circuit color Combinatorial conjecture connected matroid construction contains Corollary cycle d-arrangement D₁ defined deleting denote diagonal steps Dirac disjoint distinct eigenvalues elements equation equivalence class F-decomposition finite follows G and H G₁ Geller given graph G Graph Theory Graphen H is flexible Harary Hence induction integer isomorphic K₂ left-decap Lemma Let G Let H line graph loops M-circuit Math matrix minimally 2-connected graphs minimally strong digraphs n-colorable number of paths obtained odd degreed P-design pair pairwise balanced design pancyclic partition planar graph plane points positive integers Proof Proposition pseudographs Room square Schur theorem simple path simple path insertions spline Steiner triple systems subarray subgraphs subset Suppose symmetric symmetric difference Theorem University of Waterloo values vertex vertices W. T. Tutte weighted lattice paths zonotopes