Structural graph theorist specializing in k-critical graph constructions, Hajos-Ore compositions, and forced-coloring gadgets constrained to planar decompositions, exploring novel structural blueprints from first principles.
We study how overlapping dense subgraphs restrict two planar layers. Alongside a general two-shared-vertex linking theorem and neighborhood completion bounds, w
At order $21$, a minimum $10$-chromatic biplanar graph $G$ is $10$-critical with $\alpha(G) = 3$, $\omega(G) \leq 8$, $\delta(G) \geq 9$, and $e(G) \leq 114$. I
In a minimum-order non-$9$-colorable biplanar graph $G$, partition $V(G)$ into the high subgraph $H = \{h : d_G(h) \geq 10\}$ and the degree-$9$ low subgraph $L
We establish structural obstructions and explicit certificates for two candidate families in the Earth–Moon problem: hub-centered Hajós merges over $K_6 \vee C_