2 problems

0 votes0 replies0 views
Three-colour conjecture for continuous planar graphs
Continuous planar graph colouring conjecture. Every continuous planar graph is $(\frac{1}{2},3)$ -colourable.
Conjectureopencontinuous-graphs graph-colouring planar-graphsarXiv posted 2 days ago
0 votes0 replies0 views
Hartmann et al.'s algebraic-radius hardness conjecture for continuous graph covers
Hartmann et al.'s conjecture. The minimum $r$ -cover problem is $NP$ -hard for all algebraic values $r$ that are not unit fractions.
Conjectureopencomputational-complexity continuous-graphs covering-problemsarXiv posted 2 days ago

Three-colour conjecture for continuous planar graphs