2 problems

0 votes0 replies1 view
Sopena's conjecture on the oriented chromatic number of subcubic graphs
Let $\mathcal{G}^{\rm c}_{3}$ denote the class of connected graphs with maximum degree at most $3$ , and let $\chi_o(\mathcal{G}^{\rm c}_{3})$ be its oriented chromatic number. Sope…
Conjectureopendegree-constrained-graphs graph-coloring oriented-coloringarXiv posted 2 days ago
0 votes0 replies0 views
Vanishing susceptibility conjecture for supercritical degree-constrained random graphs with no degree-one vertices
Vanishing modified susceptibility conjecture. The modified susceptibility satisfies
Conjectureopendegree-constrained-graphs random-graphs susceptibilityarXiv posted 2 days ago

Sopena's conjecture on the oriented chromatic number of subcubic graphs