## Ars Combinatoria, Volumes 40-41Department of Combinatorics and Optimization, University of Waterloo., 1995 - Combinatorial analysis |

### 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

2-distant coloring 8-blocks adjacent algorithm antichains arcs assume balanced ternary blocks of length BPTD circle order clique codes column Combinatorial competition graphs competition numbers complete graph component conjecture connected graph consider construction contains contradiction Corollary corresponding cover curves cycle defined deleting digraph Discrete Math disjoint dominating set edge-connectivity elements equality exactly exists Figure finite follows function G V(G given graph G Graph Theory Gray code gt-pair Hadamard matrix Hamiltonian Hence implies induced subgraph integer intersection interval graph isolated vertices isomorphic labeling latin square least Lemma Let G linear extension maximal minimal minimum number of edges number of points number system obtain outdegree pair parameters path polynomials posets positive integers prey problem proof of Theorem Property Proposition prove result rows satisfying sequence series-parallel graph spanning tree square of order subset Suppose symmetric triangle triple vertex vertices of degree zero-sum