AAAAAA
Results:
1-8
|
Results: 8
Authors:
Corneil, DG
Dragan, FF
Habib, M
Paul, C
Citation: Dg. Corneil et al., Diameter determination on restricted graph families, DISCR APP M, 113(2-3), 2001, pp. 143-166
Strongly orderable graphs - A common generalization of strongly chordal and chordal bipartite graphs
Authors:
Dragan, FF
Citation: Ff. Dragan, Strongly orderable graphs - A common generalization of strongly chordal and chordal bipartite graphs, DISCR APP M, 99(1-3), 2000, pp. 427-442
Authors:
Dragan, FF
Nicolai, F
Citation: Ff. Dragan et F. Nicolai, LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem, DISCR APP M, 98(3), 2000, pp. 191-207
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
Authors:
Brandstadt, A
Dragan, FF
Kohler, E
Citation: A. Brandstadt et al., Linear time algorithms or hamiltonian problems on (claw, net)-free graphs, SIAM J COMP, 30(5), 2000, pp. 1662-1677
Authors:
Dragan, FF
Citation: Ff. Dragan, Almost diameter of a house-hole-free graph in linear time via LexBFS, DISCR APP M, 95(1-3), 1999, pp. 223-239
Authors:
Dragan, FF
Nicolai, F
Brandstadt, A
Citation: Ff. Dragan et al., Convexity and HHD-free graphs, SIAM J DISC, 12(1), 1999, pp. 119-135
Authors:
Dragan, FF
Nicolai, F
Citation: Ff. Dragan et F. Nicolai, LexBFS-orderings and powers of HHD-free graphs, INT J COM M, 71(1), 1999, pp. 35-56
Risultati:
1-8
|