## Congressus Numerantium, Volumes 170-171 |

### What people are saying - Write a review

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

### Other editions - View all

### Common terms and phrases

2-stratified graph adjacency matrix algorithm bipartite graph blocks blue vertex bond percolation clique representation codes Combinatorial complete graph components Computing Congressus Numerantium conjecture connected consider contradiction coordinate Corollary corresponding covering designs crossing number cubic graphs cutset cycle-dominating set cycle-independent decode defined denote digraph directed graph disks edge-graceful labelings encoding example exists F contains free cover function graph G Hamiltonian cycle Hence hyperplane induced subgraph initial vertex integer intersection graph isomorphic lattice Lemma length Let G load Mathematics maximal minimal multiset n-cycle node NP-Complete one-point union optimal pair Paley graphs palindromes parameters partition path percolation threshold polynomial problem processor Proof queue recurrence relation red vertex red vertices result routing shown in Figure Sin-Min Lee slave solution star graphs Steiner set subset super edge-graceful Suppose Theorem tournament tree vector vertex vertex labeled vertex set vertical edge