2 papers
math.CO2024
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áta…
math.CO2024
On high genus extensions of Negami's conjecture
Marcin BriaÅski, James Davies, Jane Tan
Negami's famous planar cover conjecture is equivalent to the statement that a connected graph can be embedded in the projective plane if and only if it has a projective planar cove…