Pathwidth

#	Item
51	Structural parameterizations for boxicity Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt Abstract The boxicity of a graph G is the least integer d such that G has an intersection model of axis-aligned d-dime Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-02-20 07:20:59 Boxicity Geometric graph theory Planar graphs Pathwidth Intersection graph Treewidth Chordal graph Clique Interval graph Outerplanar graph Vertex cover Graph coloring
52	C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/split-vs-set-representation/3-sun-free-split-rootsdvi Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-02-02 16:29:21 Graph operations Graph coloring Chordal graph Line graph Split graph Clique Forbidden graph characterization Neighbourhood Pathwidth Strongly chordal graph
53	Nondeterministic Graph Searching: From Pathwidth to Treewidth Fedor V. Fomin1 , Pierre Fraigniaud2 , and Nicolas Nisse2 Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2007-01-17 10:04:40 Tree decomposition Branch-decomposition Minor Tree Connectivity Degree Directed graph Neighbourhood Cycle rank Graph theory Graph operations Path decomposition