On the relationship between NLC-width and linear NLC-widthGURSKI, Frank; WANKE, Egon.Theoretical computer science. 2005, Vol 347, Num 1-2, pp 76-89, issn 0304-3975, 14 p.Article

A local characterization of bounded clique-width for line graphsGURSKI, Frank; WANKE, Egon.Discrete mathematics. 2007, Vol 307, Num 6, pp 756-759, issn 0012-365X, 4 p.Article

Clique-width of graphs defined by one-vertex extensionsRAO, Michaël.Discrete mathematics. 2008, Vol 308, Num 24, pp 6157-6165, issn 0012-365X, 9 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

Characterizations for co-graphs defined by restricted NLC-width or clique-width operationsGURSKI, Frank.Discrete mathematics. 2006, Vol 306, Num 2, pp 271-277, issn 0012-365X, 7 p.Article

On the structure of (P₅, gem)-free graphsBRANDSTÄDT, Andreas; KRATSCH, Dieter.Discrete applied mathematics. 2005, Vol 145, Num 2, pp 155-166, issn 0166-218X, 12 p.Article

Hypergraphs in model checking: Acyclicity and hypertree-width versus clique-widthGOTTLOB, Georg; PICHLER, Reinhard.SIAM journal on computing (Print). 2004, Vol 33, Num 2, pp 351-378, issn 0097-5397, 28 p.Article

The rank-width of the square gridJELINEK, Vít.Discrete applied mathematics. 2010, Vol 158, Num 7, pp 841-850, issn 0166-218X, 10 p.Article

Recent developments on graphs of bounded clique-widthKAMIRISKI, Marcin; LOZIN, Vadim V; MILANIC, Martin et al.Discrete applied mathematics. 2009, Vol 157, Num 12, pp 2747-2761, issn 0166-218X, 15 p.Conference Paper

Line graphs of bounded clique-widthGURSKI, Frank; WANKE, Egon.Discrete mathematics. 2007, Vol 307, Num 22, pp 2734-2754, issn 0012-365X, 21 p.Article

Linear layouts measuring neighbourhoods in graphsGURSKI, Frank.Discrete mathematics. 2006, Vol 306, Num 15, pp 1637-1650, issn 0012-365X, 14 p.Article

MSOL partitioning problems on graphs of bounded treewidth and clique-widthRAO, Michaël.Theoretical computer science. 2007, Vol 377, Num 1-3, pp 260-267, issn 0304-3975, 8 p.Article

Chordal bipartite graphs of bounded tree- and clique-widthLOZIN, V; RAUTENBACH, D.Discrete mathematics. 2004, Vol 283, Num 1-3, pp 151-158, issn 0012-365X, 8 p.Article

Graph subcolorings: Complexity and algorithmsFIALA, Jiri; JANSEN, Klaus; VAN BANG LE et al.SIAM journal on discrete mathematics (Print). 2003, Vol 16, Num 4, pp 635-650, issn 0895-4801, 16 p.Article

Graphs of linear clique-width at most 3HEGGERNES, Pinar; MEISTER, Daniel; PAPADOPOULOS, Charis et al.Theoretical computer science. 2011, Vol 412, Num 39, pp 5466-5486, issn 0304-3975, 21 p.Article

Algorithms for vertex-partitioning problems on graphs with fixed clique-widthGERBER, Michael U; KOBLER, Daniel.Theoretical computer science. 2003, Vol 299, Num 1-3, pp 719-734, issn 0304-3975, 16 p.Article

On the OBDD size for graphs of bounded tree-and clique-widthMEER, Klaus; RAUTENBACH, Dieter.Discrete mathematics. 2009, Vol 309, Num 4, pp 843-851, issn 0012-365X, 9 p.Article

Solving #SAT using vertex coversNISHIMURA, Naomi; RAGDE, Prabhakar; SZEIDER, Stefan et al.Acta informatica. 2007, Vol 44, Num 7-8, pp 509-523, issn 0001-5903, 15 p.Article

Vertex-minor reductions can simulate edge contractionsMAMADOU MOUSTAPHA KANTE.Discrete applied mathematics. 2007, Vol 155, Num 17, pp 2328-2340, issn 0166-218X, 13 p.Article

On powers of graphs of bounded NLC-width (Clique-width)SUCHAN, Karol; TODINCA, Ioan.Discrete applied mathematics. 2007, Vol 155, Num 14, pp 1885-1893, issn 0166-218X, 9 p.Conference Paper

On the relationship between clique-width and treewidthCORNEIL, Derek G; ROTICS, Udi.SIAM journal on computing (Print). 2005, Vol 34, Num 4, pp 825-847, issn 0097-5397, 23 p.Article

INTRACTABILITY OF CLIQUE-WIDTH PARAMETERIZATIONSFOMIN, Fedor V; GOLOVACH, Petr A; LOKSHTANOV, Daniel et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1941-1956, issn 0097-5397, 16 p.Article

RANK-WIDTH AND WELL-QUASI-ORDERINGOUM, Sang-Il.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 2, pp 666-682, issn 0895-4801, 17 p.Article

CLIQUE-WIDTH IS NP-COMPLETEFELLOWS, Michael R; ROSAMOND, Frances A; ROTICS, Udi et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 909-939, issn 0895-4801, 31 p.Article