Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
From MaRDI portal
Publication:2373937
DOI10.1007/s00373-007-0721-4zbMath1137.01314OpenAlexW1975484860WikidataQ59699134 ScholiaQ59699134MaRDI QIDQ2373937
Adrian Bondy, William Cook, Bruce A. Reed, David Avis
Publication date: 19 July 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0721-4
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weakly triangulated graphs
- Solution of large-scale symmetric travelling salesman problems
- Bull-free Berge graphs are perfect
- Star-cutsets and perfect graphs
- On cutting-plane proofs in combinatorial optimization
- Some properties of minimal imperfect graphs
- The ellipsoid method and its consequences in combinatorial optimization
- The discipline number of a graph
- A method in graph theory
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- On graphs with Hamiltonian squares
- In praise of Claude Berge
- On certain polytopes associated with graphs
- A combinatorial theorem in plane geometry
- Claude Berge: June 5, 1926 -- June, 30, 2002
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Not every 2-tough graph is Hamiltonian
- On the separation of maximally violated mod-\(k\) cuts
- The story of perfectly orderable graphs
- Skew partitions in perfect graphs
- A structure theorem for the consecutive 1's property
- On Hamilton's ideals
- Monochromatic paths in edge-colored graphs
- Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
- A characterization of perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- Edmonds polytopes and a hierarchy of combinatorial problems
- Tough graphs and Hamiltonian circuits.
- Separating Maximally Violated Comb Inequalities in Planar Graphs
- Separating a Superclass of Comb Inequalities in Planar Graphs
- Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem
- On the symmetric travelling salesman problem I: Inequalities
- Outline of an algorithm for integer solutions to linear programs
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Many hard examples for resolution
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- A Greedy Heuristic for the Set-Covering Problem
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Hard Knapsack Problems
- TSPLIB—A Traveling Salesman Problem Library
- Determining the Stability Number of a Graph
- Maximum matching and a polyhedron with 0,1-vertices
- The smallest triangle-free 4-chromatic 4-regular graph
- Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
- Flip-Flops in Hypohamiltonian Graphs
- Hypergraphs and Ramseyian Theorems
- Edmonds polytopes and weakly hamiltonian graphs
- Geometry of cuts and metrics
