Graph minors. III: Planar tree-widthROBERTSON, N; SEYMOUR, P. D.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 1, pp 49-64, issn 0095-8956Article

The treewidth and pathwidth of hypercubesCHANDRAN, L. Sunil; KAVITHA, T.Discrete mathematics. 2006, Vol 306, Num 3, pp 359-365, issn 0012-365X, 7 p.Article

The pathwidth and treewidth of cographsBODLAENDER, H. L; MÖHRING, R. H.SIAM journal on discrete mathematics (Print). 1993, Vol 6, Num 2, pp 181-188, issn 0895-4801Article

Treewidth of chordal bipartite graphsKLOKS, T; KRATSCH, D.Journal of algorithms (Print). 1995, Vol 19, Num 2, pp 266-281, issn 0196-6774Article

Graph minors. X, Obstructions to tree-decompositionROBERTSON, N; SEYMOUR, P. D.Journal of combinatorial theory. Series B. 1991, Vol 52, Num 2, pp 153-190, issn 0095-8956Article

A Menger-like property of tree-width: the finite caseTHOMAS, R.Journal of combinatorial theory. Series B. 1990, Vol 48, Num 1, pp 67-76, issn 0095-8956Article

Degree-constrained decompositions of graphs : Bounded treewidth and planarityBAZGAN, Cristina; TUZA, Zsolt; VANDERPOOTEN, Daniel et al.Theoretical computer science. 2006, Vol 355, Num 3, pp 389-395, issn 0304-3975, 7 p.Article

Safe separators for treewidthBODLAENDER, Hans L; KOSTER, Arie M. C. A.Discrete mathematics. 2006, Vol 306, Num 3, pp 337-350, issn 0012-365X, 14 p.Article

The complexity of counting homomorphisms seen from the other sideDALMAU, Victor; JONSSON, Peter.Theoretical computer science. 2004, Vol 329, Num 1-3, pp 315-323, issn 0304-3975, 9 p.Article

Nonrepetitive colorings of graphs of bounded tree-widthKÜNDGEN, André; PELSMAJER, Michael J.Discrete mathematics. 2008, Vol 308, Num 19, pp 4473-4478, issn 0012-365X, 6 p.Conference Paper

Domination and total domination on asteroidal triple-free graphsKRATSCH, D.Discrete applied mathematics. 2000, Vol 99, Num 1-3, pp 111-123, issn 0166-218XConference Paper

Precoloring extension. I. Interval graphsBIRO, M; HUJTER, M; TUZA, ZS et al.Discrete mathematics. 1992, Vol 100, Num 1-3, pp 267-279, issn 0012-365XArticle

Parallel algorithms for series parallel graphs and graphs with treewidth twoBODLAENDER, H. L; VAN ANTWERPEN-DE FLUITER, B.Algorithmica. 2001, Vol 29, Num 4, pp 534-559, issn 0178-4617Article

Tree-width of graphs without a 3 x 3 grid minorBIRMELE, E; BONDY, J. A; REED, B. A et al.Discrete applied mathematics. 2009, Vol 157, Num 12, pp 2577-2596, issn 0166-218X, 20 p.Conference Paper

Characterizations for restricted graphs of NLC-width 2GURSKI, Frank.Theoretical computer science. 2007, Vol 372, Num 1, pp 108-114, issn 0304-3975, 7 p.Article

Cutwidth I : A linear time fixed parameter algorithmTHILIKOS, Dimitrios M; SEMA, Maria; BODLAENDER, Hans L et al.Journal of algorithms (Print). 2005, Vol 56, Num 1, pp 1-24, issn 0196-6774, 24 p.Article

Computing the treewidth and the minimum fill-in with the modular decompositionBODLAENDER, Hans L; ROTICS, Udi.Lecture notes in computer science. 2002, pp 388-397, issn 0302-9743, isbn 3-540-43866-1, 10 p.Conference Paper

Partial k-trees with maximum chromatic numberCHLEBIKOVA, Janka.Discrete mathematics. 2002, Vol 259, Num 1-3, pp 269-276, issn 0012-365X, 8 p.Article

The pagenumber of k-trees is O(k)GANLEY, Joseph L; HEATH, Lenwood S.Discrete applied mathematics. 2001, Vol 109, Num 3, pp 215-221, issn 0166-218XArticle

A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphsBROERSMA, H. J; DAHLHAUS, E; KLOKS, T et al.Discrete applied mathematics. 2000, Vol 99, Num 1-3, pp 367-400, issn 0166-218XConference Paper

Tree-width, path-width, and cutwidthKORACH, E; SOLEL, N.Discrete applied mathematics. 1993, Vol 43, Num 1, pp 97-101, issn 0166-218XArticle

Treewidth computations I. Upper boundsBODLAENDER, Hans L; KOSTER, Arie M. C. A.Information and computation (Print). 2010, Vol 208, Num 3, pp 259-275, issn 0890-5401, 17 p.Article

Computing the tutte polynomial on graphs of bounded clique-widthGIMENEZ, Omer; HLINENY, Petr; NOY, Marc et al.SIAM journal on discrete mathematics (Print). 2007, Vol 20, Num 4, pp 932-946, issn 0895-4801, 15 p.Article

A parametrized algorithm for matroid branch-widthHLINENY, Petr.SIAM journal on computing (Print). 2006, Vol 35, Num 2, pp 259-277, issn 0097-5397, 19 p.Article

Graph minors and reliable single message transmissionFICH, Faith Ellen; KÜNDGEN, André; PELSMAJER, Michael J et al.SIAM journal on discrete mathematics (Print). 2006, Vol 19, Num 4, pp 815-847, issn 0895-4801, 33 p.Article