## Proceedings of the Conference on Graph Connections, January 28-31, 1998, Cochin |

### What people are saying - Write a review

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

### Contents

Graph Connections | 3 |

Retractions Morphisms and | 10 |

The Case of Median Graphs | 19 |

4 other sections not shown

### Common terms and phrases

A-design acyclic graphoidal cover algorithm antipodal graph bipartite graph block called canonical Characterize classes of graphs clique CMG(S:G collage grammar combinatorial complete graph component conjecture connected graph convex hull convex sets convexity space covering number decorated collage defined Definition denoted Department of Mathematics designs digraph disconnected Discrete Math disjoint and edge dominating set domination number Duchet exists a vertex expansion finite fuzzy graph global dominating set graph G Graph Theory hamiltonian paths Helly Hence hypercubes hyperedges India Abstract induced subgraph inequality integer internally disjoint interval convexity interval monotone isolated vertex isomorphic J-monotone Lemma Let G M-graph mapping marked graph median graphs morphism Mulder multiset node number of vertices obtained p-group partition perfect graphs point-convex problem Proof prove QTAG quadtree Ramsey numbers regular graph retraction set of G subgraph of G Theorem transitions tree triangle graph vertex set vertices of G