ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An oriented colouring of an oriented graph is assignment cc of colours to the vertices such that no two arcs receive ordered pairs of colours (c1,c2)(c_1,c_2) and (c2,c1)(c_2,c_1). It is equivalent to a homomorphism of the digraph onto some tournament of order kk.

Problem What is the maximal possible oriented chromatic number of an oriented planar graph?

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.