## Congressus Numerantium, Volume 147 |

### What people are saying - Write a review

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

### Contents

Scheduling the XFL by Jeffrey H Dinitz and Dalibor Froncek | 5 |

Suborthogonal double covers of complete graphs | 33 |

Some Operations on Probalistic Finite State Source Automata | 53 |

Copyright | |

7 other sections not shown

### Common terms and phrases

3-GDD of type A(Gi algorithm arcs bins central groupoid CnX2Cm cographs color G complete bipartite graph complete graph components of G CONGRESSUS NUMERANTIUM 147 construct Corollary deBruijn groupoid define dismantling double path duality edge color elements exists Figure finite follow skip edges Fritz John graph G Graph Theory Hall's condition hamiltonian cycle Hence holomorphy Ic-fold idempotent induced subgraph initial vertex integers intradivisional isomorphic John type L(Gi Lemma length Let G LineGCS list coloring loop Math maximum degree minimum mobile hosts MRD(v multiset NP-Complete number of paths obtained optimality criteria pair parking functions partition problem path partition pendant edge pfsa positive integers probability Proof pseudoconvex result satisfied schedule sequence SODC solicitation round strong central algebra strongly connected subsets supertrees Suppose Theorem total chromatic total coloring tree uniform 2-stratified graph V(Gi vertical edge vertices of degree WEEK x-parking