24 problems

$4_n$ existence and zigzag conjecture. (i) A z-knotted $4_n$ exists if and only if $n\geq 30$ and $n\equiv 2\pmod 4$. (ii) A tight $4_n$ exists if and only if $n\geq 8$ and…

Curvature-graph conjecture. The graph of curvatures of any tight graph of type $3_n$ is the graph in the first of those three cases.

Let $i$ be the number of faces of an irreducible $i$-hedrite, and let a central circuit be a central circuit of the hedrite. An irreducible $i$-hedrite is maximal irreducible when…

$2n-3$-edge conjecture. Every simple drawing of $K_n$ with $n\geq 3$ contains a plane Hamiltonian subdrawing on $2n-3$ edges.

Aichholzer–Orthaber–Vogtenhuber's conjecture. For each pair of vertices $s,t$ in a simple drawing of $K_n$, there exists a plane Hamiltonian path from $s$ to $t$.

Facial-cycle conjecture. Every non-decomposable critically $k$-frustrated signed plane graph has exactly $2k$ facial cycles, each of which is a negative cycle.

Let $G$ and $\hat{G}$ be a pair of simple, 3-connected plane graphs corresponding to a cellular decomposition of $\mathbb{C}$ and its dual. A circle configuration is a configuratio…

Let $G$ be a plane graph, and let $P$ be a set of non-crossing single-touch shortest paths in $G$. The path covering with forests number of $P$, denoted by $\operatorname{PCFN}(P)$…

Plane-path conjecture. There is an absolute constant $\varepsilon>0$ such that every complete $n$-vertex simple topological graph contains a plane path of length $n^{\varepsilon}$.

Let $(G,\chi)$ be a plane graph, meaning a planar graph equipped with a plane ribbon structure. A sandpile torsor structure assigns a free transitive action of the sandpile group…

Let $G$ be a plane graph, and let $u$ be a positive integer. An $nu$-facial edge-coloring of $G$ is an edge-coloring in which all edges on every facial trail of length at most…

Subdivision cyclic coloring conjecture. Every such graph $G$ satisfies

Borodin–Broersma–Glebov–van den Heuvel conjecture. Every plane graph $G$ with $\Delta^*(G)$ and $k^*$ sufficiently large has a cyclic coloring with

Borodin's cyclic coloring conjecture. Every connected plane graph $G$ satisfies

Let $G$ be a plane graph, and let $\overline{G}_{vef}$ denote its combined vertex-edge-face graph. The Alon–Tarsi conjecture. Every plane graph $G$ satisfies … If true, this would…

Let $G$ be a plane graph, and let $G_{vf}$ denote its vertex-face graph. The Alon–Tarsi conjecture. Every plane graph $G$ satisfies … This would extend the corresponding list-colou…

Maximum-degree-two conjecture. If $G[X]$ has maximum degree at most $2$, then

Acyclic high-degree conjecture. If the induced subgraph $G[X]$ is acyclic, then

Four-list conjecture. If each edge of a plane graph is assigned a list of $4$ integers, then there exists a FUM-edge-coloring assigning each edge a color from its list.

Wendland's conjecture. If each vertex of a plane graph is assigned a list of $5$ integers, then there exists a FUM-coloring assigning each vertex a color from its list.

Fabrici et al.'s conjecture. If $G$ is a $2$-edge-connected plane graph, then

Let $G$ be a $3$-connected plane graph, and let $\Delta^\star$ be its maximum face size. A cyclic coloring of $G$ is a vertex coloring in which any two vertices incident with the sa…

Let $G$ be a plane graph, and assign to each vertex $v$ a list of five integers. A capital colouring is a colouring in which every face contains a unique vertex coloured with the m…

Let $G$ be a plane graph. A proper colouring of $G$ assigns integers to its vertices so that adjacent vertices receive different integers. Fabrici–Gö̈ring's conjecture. Every plane…