Date: 2014-02-20 07:20:59Boxicity Geometric graph theory Planar graphs Pathwidth Intersection graph Treewidth Chordal graph Clique Interval graph Outerplanar graph Vertex cover Graph coloring | | 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-dimeAdd to Reading ListSource URL: www.zaik.uni-koeln.deDownload Document from Source Website File Size: 347,64 KBShare Document on Facebook
|