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

### What people are saying - Write a review

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

### Related books

Introduction to Design & Analysis of Algorithms: For Anna University, 2/e Anany V. Levitin No preview available - 2009 |

### 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 |

Copyright | |

22 other sections not shown

### Other editions - View all

### Common terms and phrases

2-cocircuit 2-connected 2NPDA adjacent algorithm algorithm LST1 alternating Turing machines arithmetic progression assume bandwidth binary bipartite CFMAXP claw coloop Combinatorics complete compute configuration contains contradiction Corollary defined denote diameter difference graph dominating function edge elements exists exterior face boundary Figure finite follows Gleason's theorem graph G Graph Theory Hamilton laceable hamiltonian path Hence implies independence number induced subgraph input head integer intersection irregular digraph isomorphic labelling Latin squares least Lemma length Let G level structure logarithmic signature loop Math matrix matroid maximum clique minimal dominating neighbor nonsingular obtained pair panconnected permutation planar graph plane of order points problem project-join Proof Proposition pushdown pushdown automata quadrangle quadratic residue R. B. Killgrove separating triangle sequence square free squares of order stack subset subtree sum graph Suppose symbol Theorem tournament tree triangular faces values vertex vertices width