Conjecture on dispersability of bipartite cubic planar graphs
Statement
Let be a bipartite cubic planar graph, meaning that is bipartite, planar, and every vertex has degree three. A graph is dispersable if it has a proper -edge-colouring and a -page book embedding in which all edges of one colour lie on the same page, where is the maximum degree of . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.