47 citations · 678 across the 85 of their papers we have counts for
3 papers · 1 filter
Colouring t-perfect graphs
Maria Chudnovsky, Linda Cook, James Davies +2
Perfect graphs can be described as the graphs whose stable set polytopes are defined by their non-negativity and clique inequalities (including edge inequalities). In 1975, Chvátal…
Sharing tea on a graph
J. Pascal Gollin, Kevin Hendrey, Hao Huang +6
Motivated by the analysis of consensus formation in the Deffuant model for social interaction, we consider the following procedure on a graph . Initially, there is one unit of t…
Linear bounds on treewidth in terms of excluded planar minors
J. Pascal Gollin, Kevin Hendrey, Sang-il Oum +1
One of the fundamental results in graph minor theory is that for every planar graph , there is a minimum integer such that graphs with no minor isomorphic to have tre…