Login / Signup
Planar graphs without cycles of length 4 or 5 are (11: 3)-colorable.
Zdenek Dvorák
Xiaolan Hu
Published in:
Eur. J. Comb. (2019)
Keyphrases
</>
planar graphs
minimum weight
approximation algorithms
undirected graph