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

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

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

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

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

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

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

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

INDUCTIVE COMPUTATIONS ON GRAPHS DEFINED BY CLIQUE-WIDTH EXPRESSIONSCARRERE, Frédérique.Informatique théorique et applications (Imprimé). 2009, Vol 43, Num 3, pp 625-651, issn 0988-3754, 27 p.Article

Chordal co-gem-free and (P₅, gem)-free graphs have bounded clique-widthBRANDSTÄDT, Andreas; LE, Hoang-Oanh; MOSCA, Raffaele et al.Discrete applied mathematics. 2005, Vol 145, Num 2, pp 232-241, issn 0166-218X, 10 p.Article

Vertex disjoint paths on clique-width bounded graphsGURSKI, Frank; WANKE, Egon.Theoretical computer science. 2006, Vol 359, Num 1-3, pp 188-199, issn 0304-3975, 12 p.Article

On the band-, tree-, and clique-width of graphs with bounded vertex degreeLOZIN, V; RAUTENBACH, D.SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 1, pp 195-206, issn 0895-4801, 12 p.Article

Compact labelings for efficient first-order model-checkingCOURCELLE, Bruno; GAVOILLE, Cyril; MAMADOU MOUSTAPHA KANTE et al.Journal of combinatorial optimization. 2011, Vol 21, Num 1, pp 19-46, issn 1382-6905, 28 p.Article

Counting truth assignments of formulas of bounded tree-width or clique-widthFISCHER, E; MAKOWSKY, J. A; RAVVE, E. V et al.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 511-529, issn 0166-218X, 19 p.Conference Paper

Solving some NP-complete problems using split decompositionRAO, Michaël.Discrete applied mathematics. 2008, Vol 156, Num 14, pp 2768-2780, issn 0166-218X, 13 p.Article

Trees, grids, and MSO decidability : From graphs to matroidsHLINENY, Petr; SEESE, Detlef.Theoretical computer science. 2006, Vol 351, Num 3, pp 372-393, issn 0304-3975, 22 p.Conference Paper