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
2-connected adjacent algorithm appear applied arrangements array assume balanced block bound called cardinality cells characterization circuit column complete condition conjecture connected consider construction contains Corollary corresponding cycle defined deleting denote determined diagonal steps distinct edges elements equal equations equivalence exactly example exists fact Figure finite flexible four function give given graph Hence implies induction integer isomorphic known Latin squares lattice paths least Lemma length line graph loops Math matroid MICHIGAN minimally strong obtained occurs odd degreed once orthogonal pair path plane points positive possible prime problem produce Proof Proposition prove rank REFERENCES relation Room square satisfy simple solution strong digraphs subset Suppose symbols Theorem Theory tree University values vertex vertices