## Congressus Numerantium, Volumes 146-147 |

### What people are saying - Write a review

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

### Contents

Norman J Pullman | 7 |

On TriangleFree Regular Graphs Containing A Cut Vertex by R S Rees | 29 |

Two Conjectures on the Index of Convergence of an Irreducible Boolean | 43 |

Copyright | |

9 other sections not shown

### Common terms and phrases

adjacent algorithm antichain arcs assume backward operations biclique biclique cover bipartite graph Boolean central groupoid circular-arc graphs clique cographs column Combinatorial complete graph components Congressus Numerantium connecting edge contains Corollary cost cycle dc-subgraphs defined degree digraph domination double path edge color elements exactly exists Figure finite graph G Graph Theory hamiltonian Hamiltonian path Hankel diagonal Hankel matrices Hence idempotent implies induced subgraph integer irreducible isomorphic Lemma Let G Linear Algebra Linear Algebra Appl Linear Operators Math Mathematics matrix maximum minimum monochromatic path nonnegative NP-Complete obtained optimal file transfer orthogonal pair parking functions permutation posets positive integers prime Pullman result satisfies schedule sequence sign pattern SODC star graphs strong central algebra strongly preserves subset sum cover supermagic Suppose tc(D Theorem total chromatic total coloring tree upper ideal upset path upset tournament V(Gi vertex set vertices weight