Vašek Chvátal

Available identifiers

zbMath Open chvatal.vasekMaRDI QIDQ641184

List of research outcomes

Publication	Date of Publication	Type
The Discrete Mathematical Charms of Paul Erdős	2021-03-15	Paper
Correction to: ``A de Bruijn-Erdős theorem in graphs?	2019-06-12	Paper
A de Bruijn-Erdős theorem in graphs?	2019-06-12	Paper
McCulloch-Pitts Brains and Pseudorandom Functions	2019-06-04	Paper
Antimatroids, Betweenness, Convexity	2017-04-07	Paper
A de Bruijn-Erdős theorem for chordal graphs	2015-04-22	Paper
A de Bruijn-Erdős theorem for 1–2 metric spaces	2015-01-27	Paper
Number of lines in hypergraphs	2014-05-06	Paper
A de Bruijn - Erd\H{o}s theorem and metric spaces	2014-03-25	Paper
Lines in hypergraphs	2014-03-17	Paper
Local cuts for mixed-integer programming	2013-08-05	Paper
On Reichenbach's causal betweenness	2012-11-15	Paper
Comparison of two techniques for proving nonexistence of strongly regular graphs	2012-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q3104252	2011-12-19	Paper
Finite Sholander trees, trees, and their betweenness	2011-10-21	Paper
Solution of a Large-Scale Traveling-Salesman Problem	2010-06-03	Paper
Another abstraction of the Erdős-Szekeres happy end theorem	2010-03-26	Paper
Certification of an optimal TSP tour through 85,900 cities	2009-02-23	Paper
How To Be Fickle	2008-09-17	Paper
Remembering Leo Khachiyan	2008-09-10	Paper
Problems related to a de Bruijn-Erdös theorem	2008-09-10	Paper
https://portal.mardi4nfdi.de/entity/Q3425132	2007-03-05	Paper
Sylvester-Gallai theorem and metric betweenness	2004-09-22	Paper
https://portal.mardi4nfdi.de/entity/Q4735941	2004-08-09	Paper
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems	2003-09-01	Paper
Claude Berge: June 5, 1926 -- June, 30, 2002	2003-07-08	Paper
Dirac-type characterizations of graphs without long chordless cycles	2002-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q2758343	2002-12-01	Paper
On the solution of traveling salesman problems	1998-08-06	Paper
In praise of Claude Berge	1997-07-20	Paper
Which claw-free graphs are perfectly orderable?	1994-03-13	Paper
The discipline number of a graph	1992-06-25	Paper
Packing paths perfectly	1990-01-01	Paper
Two-colourings that decompose perfect graphs	1990-01-01	Paper
Recognizing claw-free perfect graphs	1988-01-01	Paper
Many hard examples for resolution	1988-01-01	Paper
Bull-free Berge graphs are perfect	1987-01-01	Paper
On the Maximum Weight Clique Problem	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3340494	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3323698	1983-01-01	Paper
Balancing signed graphs	1981-01-01	Paper
Hard Knapsack Problems	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4188659	1978-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Vašek Chvátal