Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 3 |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Common terms and phrases
3RD S-E CONF adjacent algebra algorithm alternating edges approximation assume average number block design calculated cell chromatic polynomial closed braids coefficients COMBINATORICS complete block complete subgraph congruent number conjecture connected contains Corollary crossing number cycle defined denote determine Diophantine equation elements endpoints equation exist factor Figure finite Florida Atlantic University given graph G GRAPH THEORY hashing function Hence hypohamiltonian graphs hypotraceable graph integer irreducible KNOT label Latin squares lattice Lemma linear major rotation Math matrix matroid method minimal modulo nodes number of edges number of probes obtained occur odd chords P,Q)-homomorphism P,Q)-system pair parameters partial cut partition planar graph polynomial prime problem PROC Proof quadratic secondary flat solution solve spanning path spline square free square of side subgraph of G subsets symbol tree edge type S Latin uniform edges University of Manitoba University of Waterloo values vector vertex vertices of valence
Bibliographic information
| Title | Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 3 Volume 17 of Congressus numerantium |
| Publisher | Utilitas Mathematica Pub |
| Original from | the University of California |
| Digitized | Dec 16, 2010 |
| Export Citation | BiBTeX EndNote RefMan |