Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Chv{\'{a}}tal, V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Recognizing dart-free perfect graphs
V. Chvátal
,
J. Fonlupt
,
L. Sun
,
A. Zemirline
SIAM Journal on Computing
31
(5), 2002, pp. 1315-1338
Resolution search
V. Chvátal
Discrete Applied Mathematics
73
(1), 1997, pp. 81-99
Which line-graphs are perfectly orderable?
V. Chvátal
Journal of Graph Theory
14
(5), 1990, pp. 555-558
Four classes of perfectly orderable graphs
V. Chvátal
,
C.T. Hoàng
,
N.V.R. Mahadev
,
D. de Werra
Journal of Graph Theory
11
(4), 1987, pp. 481-495
Recognizing decomposable graphs
V. Chvátal
Journal of Graph Theory
8
(1), 1984, pp. 51-53
Three-regular subgraphs of four-regular graphs
V. Chvátal
,
H. Fleischner
,
J. Sheehan
,
C. Thomassen
Journal of Graph Theory
3
(4), 1979, pp. 371-386
Tree-complete graph Ramsey numbers
V. Chvátal
Journal of Graph Theory
1
(1), 1977, pp. 93-93
A method in graph theory
J.A. Bondy
,
V. Chvátal
Discrete Mathematics
15
(2), 1976, pp. 111-135
Edmonds polytopes and a hierarchy of combinatorial problems
V. Chvátal
Discrete Mathematics
4
, 1973, pp. 305-337
Tough graphs and hamiltonian circuits
V. Chvátal
Discrete Mathematics
5
, 1973, pp. 215-228
Ramsey's theorem and self-complementary graphs
V. Chvátal
,
P. Erdŏs
,
Z. Hedrlín
Discrete Mathematics
3
, 1972, pp. 301-304