3 papers
cs.DS2022
A DFS Algorithm for Maximum Matchings in General Graphs
Tony T. Lee, Bojun Lu, Hanli Chu
In this paper, we propose a depth-first search (DFS) algorithm for searching maximum matchings in general graphs. Unlike blossom shrinking algorithms, which store all possible alte…
cs.DM2013
Solvability of Cubic Graphs - From Four Color Theorem to NP-Complete
Tony T. Lee, Qingqi Shi
Similar to Euclidean geometry, graph theory is a science that studies figures that consist of points and lines. The core of Euclidean geometry is the parallel postulate, which prov…
cs.DS2011
Randomized -Edge-Coloring via Quaternion of Complex Colors
Tony T. Lee, Yujie Wan, Hao Guan
This paper explores the application of a new algebraic method of color exchanges to the edge coloring of simple graphs. Vizing's theorem states that the edge coloring of a simple g…