## Ars Combinatoria, Volume 39Department 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.

### Contents

Erratum by Vladimir D Tonchev | 3 |

Greedy Ordered Sets With No Four Cycles by Nejib Zaguia | 25 |

Critical Sets and their Lower Bounds by Diane Donovan | 33 |

Copyright | |

24 other sections not shown

### Common terms and phrases

2-designs adjacent array assume automorphism automorphism group bandwidth basic subgraph bijection colorings column Combinatorial component conjecture construction contradiction Corollary corresponding define denote Department of Mathematics disjoint doubly cyclic dual edge-graceful edge-neighbor-connectivity elements exists a simple follows frame SOLS G and G G contains given graph G Graph Theory Hence hidden vertex hyperedges hypergraph implies independent edges induced subgraph ISOLS isomorphic labeled latin square representing Lemma Let G linear extension lower bound Math maximal independent set maximal total matching minimal critical set n-graph n-graph G NP-complete obtain ordered set ordered triple pairs parallel classes parameters partition path permutation representations points polynomial positive integer projective plane Proof prove quadruples quasigroup regular triples result rook polynomial satisfy Schreier coset graph secant line SOLS of type square of order Stolarsky interspersion subset subsquares Suppose symmetric Theorem Theory threads vertex set vertices W-completion