Graphs with bounded tree-width and large odd-girth are almost bipartite
Résumé
We prove that for every k and every \epsilon > 0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + \epsilon.
Domaines
Mathématique discrète [cs.DM]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...