Chvátal, V.
Overview
Works:  23 works in 51 publications in 3 languages and 66 library holdings 

Roles:  Author, Editor 
Classifications:  QA166.16, 511.5 
Publication Timeline
.
Most widely held works by
V Chvátal
Topics on perfect graphs by
V Chvátal(
Book
)
6 editions published in 1984 in English and held by 16 WorldCat member libraries worldwide
The purpose of this book is to present selected results on perfect graphs in a single volume. These take the form of reprinted classical papers, survey papers or new results
6 editions published in 1984 in English and held by 16 WorldCat member libraries worldwide
The purpose of this book is to present selected results on perfect graphs in a single volume. These take the form of reprinted classical papers, survey papers or new results
Cutting planes in combinatorics by
V Chvátal(
Book
)
4 editions published in 1984 in German and English and held by 7 WorldCat member libraries worldwide
4 editions published in 1984 in German and English and held by 7 WorldCat member libraries worldwide
Degrees and matchings by
Vašek Chvátal(
Book
)
4 editions published in 1972 in English and Undetermined and held by 5 WorldCat member libraries worldwide
Let n, b, d be positive integers. D. Hanson proposed to evaluate f(n, b, d), the largest possible number of edges in a graph with n vertices having no vertex of degree greater than d and no set of more than b independent edges. Using the alternating path method, he found partial results in this direction. he author completes Hanson's work; the proof technique has a linear programming flavor and uses Berge's matching formula. (Author)
4 editions published in 1972 in English and Undetermined and held by 5 WorldCat member libraries worldwide
Let n, b, d be positive integers. D. Hanson proposed to evaluate f(n, b, d), the largest possible number of edges in a graph with n vertices having no vertex of degree greater than d and no set of more than b independent edges. Using the alternating path method, he found partial results in this direction. he author completes Hanson's work; the proof technique has a linear programming flavor and uses Berge's matching formula. (Author)
Longest common subsequences of two random sequences by
Vašek Chvátal(
Book
)
3 editions published in 1975 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1975 in English and held by 4 WorldCat member libraries worldwide
Selected combinatorial research problems by
Vašek Chvátal(
Book
)
4 editions published in 1972 in English and Undetermined and held by 4 WorldCat member libraries worldwide
Thirtyseven research problems are described, covering a wide range of combinatorial topics. (Author)
4 editions published in 1972 in English and Undetermined and held by 4 WorldCat member libraries worldwide
Thirtyseven research problems are described, covering a wide range of combinatorial topics. (Author)
Two results concerning multicoloring by
Stanford University(
Book
)
5 editions published between 1976 and 1977 in English and Undetermined and held by 4 WorldCat member libraries worldwide
5 editions published between 1976 and 1977 in English and Undetermined and held by 4 WorldCat member libraries worldwide
Distances in orientations of graphs by
Vašek Chvátal(
Book
)
3 editions published in 1975 in English and held by 4 WorldCat member libraries worldwide
The authors prove that there is a function h(k) such that every undirected graph G admits an orientation H with the following property: if an edge uv belongs to a cycle of length k in G then uv or vu belongs to a directed cycle of length at most h(k) in H. Next, it is shown that every undirected bridgeless graph of radius r admits an orientation of radius at most (r sup 2)+ r, and this bound is best possible. The same problem is considered with radius replaced by diameter. Finally, it is shown that the problem of deciding whether an undirected graph admits an orientation of diameter (resp. radius) two belongs to a class of problems called NPhard
3 editions published in 1975 in English and held by 4 WorldCat member libraries worldwide
The authors prove that there is a function h(k) such that every undirected graph G admits an orientation H with the following property: if an edge uv belongs to a cycle of length k in G then uv or vu belongs to a directed cycle of length at most h(k) in H. Next, it is shown that every undirected bridgeless graph of radius r admits an orientation of radius at most (r sup 2)+ r, and this bound is best possible. The same problem is considered with radius replaced by diameter. Finally, it is shown that the problem of deciding whether an undirected graph admits an orientation of diameter (resp. radius) two belongs to a class of problems called NPhard
Some Linear Programming Aspects of Combinatorics by
V Chvatal(
Book
)
3 editions published in 1975 in English and Undetermined and held by 3 WorldCat member libraries worldwide
This is the text of a lecture given at the Conference on Algebraic Aspects of Combinatorics at the University of Toronto in January, 1975. The lecture was expository, aimed at an audience with no previous knowledge of linear programming
3 editions published in 1975 in English and Undetermined and held by 3 WorldCat member libraries worldwide
This is the text of a lecture given at the Conference on Algebraic Aspects of Combinatorics at the University of Toronto in January, 1975. The lecture was expository, aimed at an audience with no previous knowledge of linear programming
Chromatic automorphisms of graphs by
Vašek Chvátal(
Book
)
3 editions published in 1972 in English and Undetermined and held by 3 WorldCat member libraries worldwide
3 editions published in 1972 in English and Undetermined and held by 3 WorldCat member libraries worldwide
A class of perfectly orderable graphs by
V Chvátal(
Book
)
1 edition published in 1989 in German and held by 3 WorldCat member libraries worldwide
1 edition published in 1989 in German and held by 3 WorldCat member libraries worldwide
Mrkvantické noviny : [Nejveselejší list(
Book
)
2 editions published in 1939 in Czech and held by 2 WorldCat member libraries worldwide
2 editions published in 1939 in Czech and held by 2 WorldCat member libraries worldwide
On the strong perfect graph conjecture by
Stanford University(
Book
)
2 editions published in 1974 in English and held by 2 WorldCat member libraries worldwide
The author presents an equivalent form of the Strong Perfect Graph Conjecture
2 editions published in 1974 in English and held by 2 WorldCat member libraries worldwide
The author presents an equivalent form of the Strong Perfect Graph Conjecture
Motolské noviny (Snop)(
Book
)
1 edition published in 1940 in Czech and held by 1 WorldCat member library worldwide
1 edition published in 1940 in Czech and held by 1 WorldCat member library worldwide
Edmonds polyhedra and weakly Hamiltonian graphs by
Vašek Chvátal(
Book
)
1 edition published in 1972 in English and held by 1 WorldCat member library worldwide
Jack Edmonds developed a new way of looking at extremal combinatorial problems and applied his technique with a great success to the problems of the maximalweight degreeconstrained subgraphs. Professor C. St. J.A. NashWilliams suggested to use Edmonds' approach in the context of hamiltonian graphs. In the present paper, the author determines a new set of inequalities (the comb inequalities) which are satisfied by the characteristic functions of hamiltonian circuits but are not explicit in the straightforward integer programming formulation. A direct application of the linear programming duality theorem then leads to a new necessary condition for the existence of hamiltonian circuits; this condition appears to be stronger than the previously known ones. Relating linear programming to hamiltonian circuits, the present paper can also be seen as a continuation of the work of Dantzig, Fulkerson and Johnson on the travelling salesman problem. (Author)
1 edition published in 1972 in English and held by 1 WorldCat member library worldwide
Jack Edmonds developed a new way of looking at extremal combinatorial problems and applied his technique with a great success to the problems of the maximalweight degreeconstrained subgraphs. Professor C. St. J.A. NashWilliams suggested to use Edmonds' approach in the context of hamiltonian graphs. In the present paper, the author determines a new set of inequalities (the comb inequalities) which are satisfied by the characteristic functions of hamiltonian circuits but are not explicit in the straightforward integer programming formulation. A direct application of the linear programming duality theorem then leads to a new necessary condition for the existence of hamiltonian circuits; this condition appears to be stronger than the previously known ones. Relating linear programming to hamiltonian circuits, the present paper can also be seen as a continuation of the work of Dantzig, Fulkerson and Johnson on the travelling salesman problem. (Author)
Combinatorial designs related to the strong perfect graph conjecture by
Université de Montréal(
Book
)
in English and held by 1 WorldCat member library worldwide
in English and held by 1 WorldCat member library worldwide
Bullfree Berge graphs are perfect by
V Chvátal(
Book
)
1 edition published in 1986 in English and held by 1 WorldCat member library worldwide
1 edition published in 1986 in English and held by 1 WorldCat member library worldwide
Twocolourings that decompose perfect graphs by
V Chvátal(
Book
)
1 edition published in 1986 in English and held by 1 WorldCat member library worldwide
1 edition published in 1986 in English and held by 1 WorldCat member library worldwide
Setpacking Problems and threshold graphs by
V Chvátal(
Book
)
1 edition published in 1973 in Undetermined and held by 1 WorldCat member library worldwide
1 edition published in 1973 in Undetermined and held by 1 WorldCat member library worldwide
Recognizing dartfree perfect grafhs(
)
1 edition published in 2000 in English and held by 1 WorldCat member library worldwide
1 edition published in 2000 in English and held by 1 WorldCat member library worldwide
A note on line digraphs and the directed maxcut problem by
V Chvátal(
Book
)
1 edition published in 1988 in English and held by 1 WorldCat member library worldwide
1 edition published in 1988 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Associated Subjects