The planar and toroidal graphs without intersecting triangles DP-4-degeneracy conjecture
The planar and toroidal graphs without intersecting triangles DP-4-degeneracy conjecture
Let be a planar or toroidal graph without intersecting triangles. Let be a cover of , where assigns to each vertex of a value in . A strictly -degenerate transversal is a transversal of inducing, in every nonempty subgraph, a vertex whose degree is less than its assigned -value. The planar and toroidal graphs without intersecting triangles conjecture. If
for each , then has a strictly -degenerate transversal. This conjecture extends established DP-colouring, list-colouring, and vertex-arboricity results for planar and toroidal graphs without intersecting triangles; the full cover statement remains open.
Sources & referencesView supporting material
Primary source
Fangyao Lu, Qianqian Wang and Tao Wang, “Cover and variable degeneracy”, arXiv:1907.06630 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.