James Alexander Schreib

collaborators

4 papers

math.CO2026

The Borowiecki-Broere Generalized Total Coloring Conjecture for Planar Graphs

James Alexander Schreib

We prove the conjecture of Borowiecki and Broere that every finite simple planar graph admits a generalized total coloring with four colors: a proper vertex coloring with four colo…

math.CO2026

A Counterexample to Wormald's Conjecture

James Alexander Schreib

We give a counterexample to Wormald's conjecture. A 16-vertex cubic graph, the disjoint union of $K_{3, 3}$ with a 10-vertex bridged graph built from two subdivided copies of $K_{4}$ ,…

math.CO2026

A construction of F-irregular graphs

James Alexander Schreib

For a fixed graph F, the F-degree of a vertex v in a host graph H is the number of subgraphs of H isomorphic to F that contain v, and H is F-irregular if its F-degrees are pairwise…

math.CO2026

A Proof of the Imbalance Conjecture

James Alexander Schreib, Yousof Yavari

For an edge $uv$ of a finite simple graph $G$ , its imbalance is $∣ d_{G} (u) - d_{G} (v) ∣$ , and the imbalance multiset $M_{G}$ consists of the imbalances of all edges of $G$ . Kozerenko and Sk…