## Congressus Numerantium, Volume 71 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

P Erdos E Kubicka and A J Schwenk | 17 |

P Erdos R J Faudree R J Gould A Gyarfas C Rousseau | 29 |

G Ebert J Hemmeter F Lazebnik and A Woldar | 39 |

Copyright | |

15 other sections not shown

### Common terms and phrases

2-connected adjacent algorithm anti-chain assume biclique bipartite graph chromatic number circulant graph clique cograph colors columu comparability graph competition cover competition graph competition multigraph complete graph conjecture connected graph consecutive consider construction contradiction copies of Kt covering number cycle defined definition denote digraph dominating set edge-graceful Edge-graceful labeling elements example exists Figure food web force an edge G Cj graph G Graph Theory hamiltonian Hedetniemi Hence induced intersection graph interval graph irredundance number label Lemma Let G linear extensions loopless matrix maximal maximum minimal realizer minimum monochromatically covers multigraph N(xm neighborhood node NP-complete number of vertices obtain optimal outerplanar outerplanar graphs P4-reducible graphs pair Partially Ordered path poset problem proof RBD(n RBG(n result sequence set of vertices spanning tree standard N-arc subpath representation subset Suppose Theorem unit interval unit interval graph vertex z-paths