The treewidth and pathwidth of hypercubes

Discrete Mathematics

Volumn 306, Issue 3, 2006, Pages 359-365

  Chandran, L Sunil ^a   Kavitha, T ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Hamming graph; Hypercube; Pathwidth; Treewidth

Indexed keywords

MATHEMATICAL MODELS; TRIANGULATION;

HAMMING GRAPH; HYPERCUBE; PATHWIDTH; TREEWIDTH;

TREES (MATHEMATICS);

EID: 33344456908     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.12.011     Document Type: Article

References (9)

1. H.L. Bodlaender A partial k-arboretum of graphs with bounded treewidth Theoret. Comput. Sci. 209 1998 1 45
2. B. Bollabás Combinatorics 1986 Cambridge University Press Cambridge
3. P. Frankl, and Z. Füredi A short proof for a theorem of Harper about Hamming spheres Discrete Math. 34 1981 311 313
4. M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
5. L. Harper Optimal numberings and isoperimetric problems on graphs J. Combin. Theory 1 1966 385 393
6. L. Harper On an isoperimetric problem for hamming graphs Discrete Appl. Math. 95 1999 285 309
7. G.O.H. Katona The hamming-sphere has minimum boundary Studia Sci. Math. Hungar. 10 1975 131 140
8. N. Robertson Graph minors II: algorithmic aspects of tree-width J. Algorithms 7 1986 309 322
9. N. Robertson, and P.D. Seymour Graph minors I: excluding a forest J. Combin. Theory Ser. B 35 1983 39 61