Titlebook: ;

Pudendal-Nerve

surrogate

sphincter

Foam-Cells

https://doi.org/10.1007/978-3-476-04307-8hs over .(2). We propose here algebraic operations on graphs that characterize rank-width. For algorithmic purposes, it is important to represent graphs by balanced terms. We give a unique theorem that generalizes several “balancing theorems” for tree-width and clique-width. New results are obtained

DNR215

https://doi.org/10.1007/978-3-658-40933-3(1.) the .-power graph of a tree has NLC-width at most .?+?2 and clique-width at most ., (2.) the .-leaf-power graph of a tree has NLC-width at most . and clique-width at most ., and (3.) the .-power graph of a graph of tree-width . has NLC-width at most (.?+?1).??1 and clique-width at most 2·(.?+?1

Panther

LARK

Markus Mangiapane,Roman P. Büchler., graphs that are both comparability and cocomparability graphs, it is known that minimal triangulations are interval graphs. We (negatively) answer the question whether every interval graph is a minimal triangulation of a permutation graph. We give a non-trivial characterisation of the class of in

Needlework

Hyperlipidemia

CHASM

https://doi.org/10.1007/978-3-662-08810-4planar drawings of planar graphs can be realized in .(..) area [9]. In this paper we consider families of DAGs that naturally arise in practice, like DAGs whose underlying graph is a tree (.), is a bipartite graph (.), or is an outerplanar graph (.). Concerning ., we show that optimal .(. log.) area