## Graph-Theoretic Concepts in Computer Science: 24th International Workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, ProceedingsThis book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'98, held in Smolenice Castle, Slovak Republic, in June 1998. The 30 revised full papers presented were carefully selected from a total of 61 submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretic applications in computer science. |

### What people are saying - Write a review

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

### Contents

1 | |

Peter Damaschke | 17 |

HansJoachim Böckenhauer | 38 |

Guillaume Fertin André Raspaud | 63 |

Olivier Togni | 78 |

Shuji Isobe Xiao Zhou Takao Nishizeki | 100 |

Jan Kratochvıl Zsolt Tuza | 114 |

Stefan Felsner Klaus Kriegel | 137 |

S O Krumke M V Marathe H Noltemeier S S Ravi H C Wirth | 215 |

Ralf Klasing | 242 |

Markus Röttger UlfPeter Schroeder | 257 |

Farhad Shahrokhi László A Székely | 272 |

Faria C M H de Figueiredo C F X Mendonça | 285 |

Sándor P Fekete Jana Kremer | 298 |

Koichi Wada Wei Chen | 324 |

Luitpold Babel Stephan Olariu | 337 |

Maurizio Talamo Paola Vocca | 164 |

Serafino Cicerone Gabriele Di Stefano | 177 |

Derek G Corneil Feodor F Dragan Michel Habib Christophe Paul | 192 |

Elias Dahlhaus | 351 |

372 | |

### Other editions - View all

Graph-Theoretic Concepts in Computer Science: 24th International Workshop ... J. Hromkovic No preview available - 1998 |

### Common terms and phrases

adjacent admitting a pair algorithm AT-free graphs biconnected BID(k bipartite graph broadcast Cayley graphs chordal graph chordless cycle circulant graphs class of graphs clique cographs component Computer Science connected consider construct contains Corollary corresponding decomposition defined definition denote digraphs dilation disjoint distance-hereditary graphs dominating set edge independent embedding exists function gossip graph G grid Hamiltonian cycle Hence HH-drawing Hromkovic hypercube independent direct tree independent set induced path induced subgraph integer internal isomorphic Lemma length Let G linear lower bound maximum number metavariables minimal separators minus dominating neighbors networks nodes NP-complete number of edges obtained optimal partial k-trees partition planar graph polynomial Proof Proposition prove pseudolines recursively resp set of vertices spanners spanning trees spider split graph subgraph of G subset t–spanners term graph Theorem total coloring treewidth triangles triconnected triconnected graph typing element upgrading variable vertex vertex set vertex-disjoint