Proceedings of the Fifteenth Southeastern Conference on Combinatorics, Graph Theory and Computing Held at Louisiana State University, March 5-8, 1984. |
Contents
An Identity Arising from Counting Independent Sets | 5 |
T A McKee | 11 |
S T Dean W T Jones and C C Yang | 19 |
Copyright | |
12 other sections not shown
Common terms and phrases
2-regular algorithm amida assume B-branch b₂ binary trees bipartite graph block graph blue adjacencies clique complete graph Computing constraints construction contains contradiction convex convex geometry convex sets corresponding cycle cyclic triples defined denote digraph discs edge-colouring element embedded equations exponential generating function Figure finite follows function G₁ graceful graph G Graph Theory Harary Hence implies inequalities input isomorphism L-matrix labelled latin squares Lemma length Math matrix Mendelsohn triple systems minimum number modulo monotonically move natural number negative nodes number of vertices obtain pair parameters partial Mendelsohn triple partition Petersen graph planar mesh player points polynomials poset problem Proof Proposition red adjacencies red C5 red edges regular graphs result S₂ semilattice sequence signed graph snarks solved step storage tape string trees subgraph Suppose symbols Theorem topological sort triangle unsatisfied equalities V₁ vertex VERTEX-EDGE W6 with center X X X X X X Y₁