E-LIB Suche - Ergebnisse für: Chvátal, V.

1

Edmonds polytopes and a hierarchy of combinatorial problems:

Chvátal, V.
Discrete Mathematics. 306 (2006) 10-11 - p. 886-904 , 2006

Link: https://doi.org/10.1016/..

2

Tough graphs and hamiltonian circuits:

Chvátal, V.
Discrete Mathematics. 306 (2006) 10-11 - p. 910-917 , 2006

Link: https://doi.org/10.1016/..

3

Recognizing Dart-Free Perfect Graphs:

Chvátal, V. ; Fonlupt, J. ; Sun, L..
SIAM Journal on Computing. 31 (2002) 5 - p. 1315-1338 , 2002

Link: https://doi.org/10.1137/..

4

Recognizing dart-free perfect graphs:

, In: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms,

Chvátal, V. ; Fonlupt, J. ; Sun, L.. - p. 50-53 , 2000

Link: https://dl.acm.org/doi/1..

5

Cutting planes and the traveling salesman problem (abstract..:

, In: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms,

Applegate, D. ; Bixby, R. ; Chvátal, V.. - p. 429 ff. , 2000

Link: https://dl.acm.org/doi/1..

6

Resolution search:

Chvátal, V
Discrete Applied Mathematics. 73 (1997) 1 - p. 81-99 , 1997

Link: https://doi.org/10.1016/..

7

Variations on a theorem of Ryser:

Cao, Dasong ; Chvátal, V. ; Hoffman, A.J..
Linear Algebra and its Applications. 260 (1997) - p. 215-222 , 1997

Link: https://doi.org/10.1016/..

8

Almost all graphs with 1.44n edges are 3‐colorable:

Chvátal, V.
Random Structures & Algorithms. 2 (1991) 1 - p. 11-28 , 1991

Link: https://doi.org/10.1002/..

9

A note on line digraphs and the directed max-cut problem:

Chvátal, V. ; Ebenegger, C.
Discrete Applied Mathematics. 29 (1990) 2-3 - p. 165-170 , 1990

Link: https://doi.org/10.1016/..

10

The discipline number of a graph:

Chvátal, V. ; Cook, W.
Discrete Mathematics. 86 (1990) 1-3 - p. 191-198 , 1990

Link: https://doi.org/10.1016/..

11

Which line‐graphs are perfectly orderable?:

Chvátal, V.
Journal of Graph Theory. 14 (1990) 5 - p. 555-558 , 1990

Link: https://doi.org/10.1002/..

12

A note on the traveling salesman problem:

Chvátal, V.
Operations Research Letters. 8 (1989) 2 - p. 77-78 , 1989

Link: https://doi.org/10.1016/..

13

On cutting-plane proofs in combinatorial optimization:

Chvátal, V. ; Cook, W. ; Hartmann, M.
Linear Algebra and its Applications. 114-115 (1989) - p. 455-499 , 1989

Link: https://doi.org/10.1016/..

14

Recognizing claw-free perfect graphs:

Chvátal, V ; Sbihi, N
Journal of Combinatorial Theory, Series B. 44 (1988) 2 - p. 154-176 , 1988

Link: https://doi.org/10.1016/..

15

Four classes of perfectly orderable graphs:

Chvátal, V. ; Hoàng, C. T. ; Mahadev, N. V. R..
Journal of Graph Theory. 11 (1987) 4 - p. 481-495 , 1987

Link: https://doi.org/10.1002/..