The disjoint cliques problem
Klaus Jansen, Petra Scheffler, Gerhard Woeginger (1997)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues”
The disjoint cliques problem
A parametric analysis of the largest induced tree problem in random graphs
M. Protasi, M. Talamo (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Counting two-graphs related to trees.
Cameron, Peter J. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Forest decompositions of graphs with cyclomatic number 2.
Farrell, E.J. (1983)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The number of labelled -arch graphs.
Lamathe, Cédric (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Forest decompositions of graphs with cyclomatic number 3.
Farrell, E.J. (1983)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Cutwidth of the -dimensional mesh of -ary trees
Imrich Vrťo (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A note on reconstructing of finite trees from small subtrees
Václav Nýdl (1990)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Deciding clique-width for graphs of bounded tree-width.
Espelage, Wolfgang, Gurski, Frank, Wanke, Egon (2003)
Journal of Graph Algorithms and Applications
Similarity: