Decomposing a triangle-free planar graph into a forest and a subcubic forest

Carl Feghali; Robert \v{S}\'amal

REVIEW

Decomposing a triangle-free planar graph into a forest and a subcubic forest

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2012.15100 v3 pith:2WN5DH3C submitted 2020-12-30 math.CO

Carl Feghali , Robert Šámal This is my paper · ORCID

classification math.CO

keywords forestgraphinducesplanartriangle-freedecomposeddecomposingdegree

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

abstract

We strengthen a result of Dross, Montassier and Pinlou (2017) that the vertex set of every triangle-free planar graph can be decomposed into a set that induces a forest and a set that induces a forest with maximum degree at most $5$, showing that $5$ can be replaced by $3$.

Discussion (0). Continue with ORCID to comment.

Pith tools