ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a bipartite cubic planar graph, meaning that GG is bipartite, planar, and every vertex has degree three. A graph is dispersable if it has a proper Δ(G)\Delta(G)-edge-colouring and a Δ(G)\Delta(G)-page book embedding in which all edges of one colour lie on the same page, where Δ(G)\Delta(G) is the maximum degree of GG. Dispersability conjecture for bipartite cubic planar graphs. All bipartite cubic planar graphs, including those that are not 3-connected, are dispersable. The source notes that 3-connected bipartite cubic planar graphs are dispersable; the conjecture concerns the remaining cases and its resolution is not specified here.

Record

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.