## Congressus Numerantium, Volumes 121-122 |

### What people are saying - Write a review

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

### Contents

Cycle covers of planar graphs by HongJian Lai | 30 |

Pursuitevasion and search problems on graphs by F V Fomin | 47 |

Mactorcriucal graphs and induced subgraphs by Odile Favaron | 59 |

Copyright | |

8 other sections not shown

### Other editions - View all

### Common terms and phrases

2-connected 2-cycle adjacency matrix adjacent algorithm assume bipartite Cayley graph cc(G cograph Computer Congressus Numerantium conjecture connected graph consider the cycle construct contradiction Corollary cycle cover cycle of length defined degree denote diam(G difference triples digraph disjoint paths domination exists Figure G is claw-free given graph G Graph Theory Hall number Hall's Condition hamiltonian cycle Hence HOMFLY polynomial independence heuristic independent set induced subgraph join knockout heuristic knot labeled graph last vertex Lemma Let G list assignment Math matrix maximal maximal independent set maximum minimal node number of edges obtain orbit proportional pair parameters path in G permutation graphs planar graphs PLTSR polynomial polyomino problem proof of Theorem proper coloring r+2s rectangle regular graphs result root satisfying sense of direction Steiner triple Steiner triple system subset Suppose symmetric tiled total number trapezoid graphs tree triple system vertex set