2 citations · 4 across the 10 of their papers we have counts for
11 papers
Total-coloring of planar graphs with maximum degree 6 and without prescribed 4-cycles
Enqiang Zhu, Yangyang Zhou, Jin Xu
The Total Coloring Conjecture (TCC) is a challenging unsolved problem posed by Behzad and Vizing independently, which states that every simple graph admits a ( +2)-total-…
Matrix Multiplication with Less Arithmetic Complexity and IO Complexity
Pu Wu, Huiqing Jiang, Zehui Shao +1
After Strassen presented the first sub-cubic matrix multiplication algorithm, many Strassen-like algorithms are presented. Most of them with low asymptotic cost have large hidden l…
55- and 56-configurations are reducible
Jin Xu
Let be a 4-chromatic maximal planar graph (MPG) with the minimum degree of at least 4 and let be an even-length cycle of .If for every in some Kempe equiv…
Theory on the Structure and Coloring of Maximal Planar Graphs (1)Recursion Formulae of Chromatic Polynomial and Four-Color Conjecture
Jin Xu
In this paper, two recursion formulae of chromatic polynomial of a maximal planar graph G are obtained. Moreover, the application of these formulaes to the proof of Four-Color Conj…
Probe Machine
Jin Xu
A novel computing model, called \emph{Probe Machine}, is proposed in this paper. Different from Turing Machine, Probe Machine is a fully-parallel computing model in the sense that…
On uniquely 3-colorable plane graphs without prescribed adjacent faces
Zepeng Li, Naoki Matsumoto, Enqiang Zhu +2
A graph is \emph{uniquely k-colorable} if the chromatic number of is and has only one -coloring up to permutation of the colors. For a plane graph , two faces…