1 problem

Narins–Pokrovskiy–Szabó conjecture on cycle-length diversity in degree 3-critical graphs
A graph is degree 3-critical if it has $n$ vertices, $2n-2$ edges, and no proper induced subgraph with minimum degree at least $3$ . Narins–Pokrovskiy–Szabó conjecture. Every degree…
opencycles degree-critical-graphs graph-theory
0 responses
011

Narins–Pokrovskiy–Szabó conjecture on cycle-length diversity in degree 3-critical graphs