Bucko–Czap conjecture on 1-planarity of lexicographic products
Statement
Let be a graph, and let denote the complete graph with two vertices. A graph is 1-planar if it has a drawing in the plane in which every edge is crossed by at most one other edge. A cactus is a connected graph in which every edge belongs to at most one cycle. Bucko–Czap's conjecture. The graph is 1-planar if and only if is a cactus. This open problem characterizes 1-planarity for lexicographic products with and concerns the relationship between graph substitution and sparse crossing structures.
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.