## Congressus Numerantium, Volume 150 |

### What people are saying - Write a review

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

### Contents

Optimal Sequences Matroid Bases Solved By Genetic Algorithms With | 5 |

Connectivity Properties of Unidirectional Star Graphs | 33 |

A Class of Graphs with Close to 1 by Peter C B Lam | 65 |

Copyright | |

7 other sections not shown

### Common terms and phrases

2-connected algorithm assume asymptotic automorphism group bond percolation C-branch canonical class chromatic number colors column Computer conference matrices construction contains Corollary cost critical probability D-loop denote directed graph dominating set dual-chordal graph e-extendable edges elementary component encoding endpoints evenly filled Figure filled with triangles given graph G Graph Theory grid graphs Hence indegree induced subgraph int(f interlocking pattern isomorphism types large faces latin squares Lemma length Let G locally 3-colorable loop M-alternating matching Math Mathematics matrix matroid medial graph minimum negacirculant conference node number of tilings orbit outdegree pair paired-dominating set pan-unicentral pancentral parameters Penrose polynomial percolation model permutation code planar graph predecessor Proof random digraphs recursive red squares red tiles respectively result sequence site percolation smallest soliton spanning tree square lattice star graph strong component strongly connected subgraph Suppose Theorem V(Hi values vertex vertex set weight system