## Graph-theoretic Concepts in Computer Science: International Workshop WG ... Proceedings |

### What people are saying - Write a review

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

### Other editions - View all

### Common terms and phrases

adjacent assignment assume AT-free graph bimodule bipartite graph child tree chordal graphs chromatic number circulant graphs Clique Covering clique of G cograph combinatorial complexity Computer Science connected components consider contains corresponding cycle depth decomposition tree define deletion denote directed cograph dominating set problem exists fc)-QPs function given graph coloring graph G Hence hypocoloring independent set induced instance integer interval graphs label LBFS leaf Lemma Let G linear LNCS matrix maximal MCS-ordering MCSLB minimal minimum coloring game minimum dominating set neighbor NP-complete NP-hard obtained optimal pair paper partition problem perfect graph permutation graphs planar graphs polynomial processor Proof recognition algorithm recursive root sequence series-parallel graph shortest path SIAM slicing graph solution solved spanning tree split decomposition subgraph of G subset subtree Theorem treewidth triangles two-level graph undirected unit disk graph upper bound vertex cover vertices weight Westfechtel Eds