## Congressus Numerantium, Volumes 132-134 |

### What people are saying - Write a review

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

### Contents

Minimal Edge Cuts to Induce Balanced Signed Graphs by David John | 5 |

Rectangle Number for Hypercubes and Complete Multipartite Graphs | 19 |

CliqueDecomposition NLCDecomposition and Modular Decomposition | 39 |

Copyright | |

18 other sections not shown

### Common terms and phrases

1-factor 3+-nodes adjacent algorithm arcs bipartite classes claw-free graphs clique Clique Problem codeword cograph colors column combinatorial complete graph component Computer connected consider construction contains Corollary corresponding cycle decomposition tree defined degree sequence denote diagonal diffusion walks digraph disjoint dominating set domination number edge-magic elements encoding example exponential sums Figure finite given graph G Graph Theory Hamiltonian Hamiltonian cycle Hence hypercube induced subgraph induced subtree integer intersection isomorphic labeled graph Lemma Let G linear Math Mathematics matrix matroid minimum node NP-complete number of vertices obtained operations optimal pairs Pallo partition polygon polynomial polyominoes positive integer processors Proof rectangle Reed-Muller code reliability problem result root rotation satisfies series-parallel graphs signed graph snake solution starter steps subset Suppose symmetry Theorem Theory tournament upper bound variables vector vertex labels vertex set vertices of G vertices with score visibility graphs weight Zerling zero