A Note on Graphs of Dichromatic Number 2
Résumé
Neumann-Lara and Škrekovski conjectured that every planar digraph is 2-colourable. We show that this conjecture is equivalent to the more general statement that all oriented K_5-minor-free graphs are 2-colourable.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|