-
2
-
-
0001919985
-
An algorithm for the Tutte polynomials of graphs of bounded treewidth
-
A. Andrzejak, An Algorithm for the Tutte Polynomials of Graphs of Bounded Treewidth, Discrete Math. 190 (1998), 39-54.
-
(1998)
Discrete Math.
, vol.190
, pp. 39-54
-
-
Andrzejak, A.1
-
3
-
-
0034399867
-
Linear time solvable optimization problems on graphs of bounded clique-width
-
B. Courcelle, J.A. Makowsky, U. Rotics, Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width, Theory Comput. Systems 33 (2000), 125-150.
-
(2000)
Theory Comput. Systems
, vol.33
, pp. 125-150
-
-
Courcelle, B.1
Makowsky, J.A.2
Rotics, U.3
-
4
-
-
0002015577
-
Upper bounds to the clique width of graphs
-
B. Courcelle, S. Olariu, Upper bounds to the clique width of graphs, Discrete Appl. Math. 101 (2000), 77-114.
-
(2000)
Discrete Appl. Math.
, vol.101
, pp. 77-114
-
-
Courcelle, B.1
Olariu, S.2
-
5
-
-
33744938873
-
On the complexity of computing the Tutte polynomial of bicircular matroids
-
to appear
-
O. Giménez, M. Noy, On the complexity of computing the Tutte polynomial of bicircular matroids, Combin. Probab. Computing, to appear.
-
Combin. Probab. Computing
-
-
Giménez, O.1
Noy, M.2
-
7
-
-
33744938388
-
The Tutte polynomial for matroids of bounded branch-width
-
to appear
-
P. Hliněný, The Tutte Polynomial for Matroids of Bounded Branch-Width, Combin. Probab. Computing, to appear (2005).
-
(2005)
Combin. Probab. Computing
-
-
Hliněný, P.1
-
8
-
-
84974224170
-
On the computational complexity of the Jones and Tutte polynomials
-
F. Jaeger, D.L. Vertigan, D.J.A. Welsh, On the Computational Complexity of the Jones and Tutte Polynomials, Math. Proc. Camb. Phil. Soc. 108 (1990), 35-53.
-
(1990)
Math. Proc. Camb. Phil. Soc.
, vol.108
, pp. 35-53
-
-
Jaeger, F.1
Vertigan, D.L.2
Welsh, D.J.A.3
-
9
-
-
84867942957
-
Edge dominating set and colorings on graphs with fixed cliquewidth
-
D. Kobler, U. Rotics, Edge dominating set and colorings on graphs with fixed cliquewidth, Discrete Applied Math. 126 (2003), 197-221.
-
(2003)
Discrete Applied Math.
, vol.126
, pp. 197-221
-
-
Kobler, D.1
Rotics, U.2
-
11
-
-
0032262138
-
Evaluating the Tutte polynomial for graphs of bounded tree-width
-
S.D. Noble, Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width, Combin. Probab. Computing 7 (1998), 307-321.
-
(1998)
Combin. Probab. Computing
, vol.7
, pp. 307-321
-
-
Noble, S.D.1
-
12
-
-
0040118794
-
A weighted graph polynomial from chromatic invariants of knots
-
S.D. Noble, D.J.A. Welsh, A weighted graph polynomial from chromatic invariants of knots, Ann. Inst. Fourier (Grenoble) 49 (1999), 1057-1087.
-
(1999)
Ann. Inst. Fourier (Grenoble)
, vol.49
, pp. 1057-1087
-
-
Noble, S.D.1
Welsh, D.J.A.2
-
14
-
-
33744946823
-
Approximating rank-width and clique-width quickly
-
WG 2005, Proceedings, to appear
-
Sang-Il Oum, Approximating Rank-width and Clique-width Quickly, In: WG 2005, Proceedings, Lecture Notes in Computer Science, to appear (2005).
-
(2005)
Lecture Notes in Computer Science
-
-
Oum, S.-I.1
|