Titlebook: ;

Ganglion

Universal Geometric Graphs,ome sub-class of planar graphs; a geometric graph is . for a class . of planar graphs if it contains an embedding, i.e., a crossing-free drawing, of every graph in ...Our main result is that there exists a geometric graph with . vertices and . edges that is universal for .-vertex forests; this exten

anaerobic

Computing Subset Transversals in ,-Free Graphs,, to graphs that do not contain some fixed graph . as an induced subgraph. By combining known and new results, we determine the computational complexity of both problems on .-free graphs for every graph . except when . for some .. As part of our approach, we introduce the . problem and prove that it

inveigh

Lipoprotein