What people are saying - Write a review
We haven't found any reviews in the usual places.
The Mystery of the Heawood Conjecture
Graph Theory Algorithms
On Eigenvalues and Colorings of Graphs
8 other sections not shown
3-connected Abel polynomials adjacent algorithm automorphism basic polynomials BIBD binomial type blocking matrix blocking pair cardinality property circuit codes clutter code of spread coimage coloring Combinatorial Theory components connected construct Corollary corresponding current graph cycle cyclic defined delta operator denote edges eigenvalues elements example exists experimental design experimental units Figure finite follows formal power series formula functional digraphs given graph G graph theory Gray codes Harary Heawood conjecture Heffter Hence incidence matrix integer isomorphic Laguerre polynomials Lemma length length-width inequality linear mapping Math mathematical matroid min-cut equality nodes nomial obtain partition permutation permutation matrices planar pn(x polynomial sequence polynomials p(x problem Proof proved qn(x reluctant functions result Riordan rooted labeled trees rotation rungs satisfies sequence of basic sequence of polynomials shift-invariant operator signed graph spanning tree structure subgraph subsets subtournament symmetric Theorem tion tournament umbral vector vertex vertices