Interview with Douglas West
From MaRDI portal
Publication:6659965
Cites work
- scientific article; zbMATH DE number 3141308 (Why is no real title available?)
- A class of solutions to the gossip problem. III
- A proof of a conjecture of Ohba
- A symmetric chain decomposition of L(4,n)
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
- Bounds for sorting by prefix reversal
- Chip games and paintability
- Cycles in color-critical graphs
- Extremal values of the interval number of a graph. II
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Improved bounds and algorithms for hypergraph 2-coloring
- Kleitman and combinatorics: A celebration
- Maximum antichains of rectangular arrays
- Mr. Paint and Mrs. Correct
- On chromatic‐choosable graphs
- On double and multiple interval graphs
- On the bar visibility number of complete bipartite graphs
- On-line list colouring of graphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Should Tables Be Sorted?
- Skew chain orders and sets of rectangles
- Some basic observations on Kelly's conjecture for graphs
- The Bar Visibility Number of a Graph
- Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
This page was built for publication: Interview with Douglas West
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659965)
