Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-8
|
Results: 8
The NP-completeness of (1,r)-subcolorability of cubic graphs
Authors:
Le, HO Le, VB
Citation:
Ho. Le et Vb. Le, The NP-completeness of (1,r)-subcolorability of cubic graphs, INF PROCESS, 81(3), 2002, pp. 157-162
Recognizing the P-4-structure of block graphs
Authors:
Brandstadt, A Le, VB
Citation:
A. Brandstadt et Vb. Le, Recognizing the P-4-structure of block graphs, DISCR APP M, 99(1-3), 2000, pp. 349-366
On stable cutsets in graphs
Authors:
Brandstadt, A Dragan, FF Le, VB Szymczak, T
Citation:
A. Brandstadt et al., On stable cutsets in graphs, DISCR APP M, 105(1-3), 2000, pp. 39-50
Tree- and forest-perfect graphs
Authors:
Brandstadt, A Le, VB
Citation:
A. Brandstadt et Vb. Le, Tree- and forest-perfect graphs, DISCR APP M, 95(1-3), 1999, pp. 141-162
Recognizing the P-4-structure of bipartite graphs
Authors:
Babel, L Brandstadt, A Le, VB
Citation:
L. Babel et al., Recognizing the P-4-structure of bipartite graphs, DISCR APP M, 93(2-3), 1999, pp. 157-168
A good characterization of cograph contractions
Authors:
Le, VB
Citation:
Vb. Le, A good characterization of cograph contractions, J GRAPH TH, 30(4), 1999, pp. 309-318
Optimal tree 3-spanners in directed path graphs
Authors:
Le, HO Le, VB
Citation:
Ho. Le et Vb. Le, Optimal tree 3-spanners in directed path graphs, NETWORKS, 34(2), 1999, pp. 81-87
The complexity of some problems related to GRAPH 3-COLORABILITY
Authors:
Brandstadt, A Le, VB Szymczak, T
Citation:
A. Brandstadt et al., The complexity of some problems related to GRAPH 3-COLORABILITY, DISCR APP M, 89(1-3), 1998, pp. 59-73
Risultati:
1-8
|