Pith. sign in

REVIEW 1 cited by

Variable degeneracy on toroidal graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1907.07141 v2 pith:PP3BG7QG submitted 2019-07-13 math.CO cs.DM

classification math.COcs.DM
keywords listmatharboricitycoloringresultstoroidalvertexcolorable
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

DP-coloring was introduced by Dvo\v{r}\'{a}k and Postle as a generalization of list coloring and signed coloring. A new coloring, strictly $f$-degenerate transversal, is a further generalization of DP-coloring and $L$-forested-coloring. In this paper, we present some structural results on planar and toroidal graphs with forbidden configurations, and establish some sufficient conditions for the existence of strictly $f$-degenerate transversal based on these structural results. Consequently, (i) every toroidal graph without subgraphs isomorphic to the configurations in Fig.2 is DP-$4$-colorable, and has list vertex arboricity at most $2$, (ii) every toroidal graph without $4$-cycles is DP-$4$-colorable, and has list vertex arboricity at most $2$, (iii) every planar graph without subgraphs isomorphic to the configurations in Fig.3 is DP-$4$-colorable, and has list vertex arboricity at most $2$. These results improve upon previous results on DP-$4$-coloring [Discrete Math. 341~(7) (2018) 1983--1986; Bull. Malays. Math. Sci. Soc. 43~(3) (2020) 2271--2285] and (list) vertex arboricity [Discrete Math. 333 (2014) 101--105; Int. J. Math. Stat. 16~(1) (2015) 97--105; Iranian Math. Soc. 42~(5) (2016) 1293--1303].

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Planar graphs without normally adjacent short cycles

    math.CO 2019-08 conditional novelty 6.0 of 10

    Every planar graph with no triangles normally adjacent to 8−-cycles, no 4-cycles normally adjacent to 6−-cycles, and no normally adjacent 5-cycles is 3-choosable.

Pith tools