Improved bound for improper colourings of graphs with no odd clique minor

HIGHLIGHTS

• who: A RT I C and collaborators from the ArxivDepartment of Computer Science, Institute of Theoretical Computer Science, ETH Zu00fcrich, Zu00fcrich, Switzerland have published the paper: Improved bound for improper colourings of graphs with no odd clique minor, in the Preprint: Arxiv
• what: The aim of this paper is to prove the following relaxation of the Odd Hadwiger`s conjecture, in which the authors allow the colouring to be improper, but instead require a constant bound (depending only on t) for the maximum size of its monochromatic components.

SUMMARY

For every . . .

 



If you want to have access to all the content you need to log in!

Thanks :)

Username or Email

Password

Remember me

Lost your password?

If you don't have an account, you can create one here.