## Congressus Numerantium, Volumes 72-73; Volume 1990 |

### What people are saying - Write a review

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

### Contents

Piazza HamiltonType Properties of Permutation Graphs | 5 |

A Gray and S Wilson A More Elementary Proof of Grunbaums Conjecture | 25 |

GowriSankaran Z Miller and J Opatrny | 33 |

21 other sections not shown

### Common terms and phrases

2-connected adjacent algebra algorithm algorithm LST1 assume automorphism group bandwidth binary Bruhat order changing and unchanging column combinatorial connected consider construction contains contradiction convex lattice polygon Corollary Coxeter group defined denote diameter difference set digraph Dynkin diagram elements example exists exterior points face boundary Figure finite follows function given graph G Graph Theory growth series hamiltonian hamiltonian path Hence implies induced induced subgraph input integer interior hull interior lattice points intersection irregular digraph isomorphic labels Latin squares lattice pentagon LB(m least Lemma length Let G level structure lines Math matrix matroid max-balanced maximal maximum clique MAXP minimal neighbor node obtained pairs permutation plane of order problem Proof properties Proposition quadratic residue recursive rewrite-complete secants sequence shortest path square free Step subgraph subset sum graph Suppose symbol Theorem tournament transitive orientation tree triangle values vertex visibility graph