Feedback game on $3$-chromatic Eulerian triangulations of surfaces

Akihiro Higashitani; Kazuki Kurimoto; Naoki Matsumoto

REVIEW

Feedback game on 3-chromatic Eulerian triangulations of surfaces

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 2002.10679 v1 pith:T33M4JPG submitted 2020-02-25 cs.DM math.CO

Feedback game on 3-chromatic Eulerian triangulations of surfaces

Akihiro Higashitani , Kazuki Kurimoto , Naoki Matsumoto This is my paper

classification cs.DM math.CO

keywords chromaticeuleriangamesurfacestriangulationsfeedbackmodulovertices

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

In this paper, we study the feedback game on $3$-chromatic Eulerian triangulations of surfaces. We prove that the winner of the game on every $3$-chromatic Eulerian triangulation of a surface all of whose vertices have degree $0$ modulo $4$ is always fixed. Moreover, we also study the case of $3$-chromatic Eulerian triangulations of surfaces which have at least two vertices whose degrees are $2$ modulo $4$, and in particular, we determine the winner of the game on a concrete class of such graphs, called an octahedral path.

Feedback game on 3-chromatic Eulerian triangulations of surfaces

discussion (0)