Searching for authors named "Guoli Ding" – sorted by Relevance.
-
On Canonical Antichains
- On canonical antichains Guoli Ding Department of Mathematics, Louisiana State University, Baton
- Add To MetaCart
-
ELA ON MINIMAL RANK OVER FINITE FIELDS ∗
- Algebra Society Volume 15, pp. 210-214, July 2006 ELA ON MINIMAL RANK OVER FINITE FIELDS ∗ GUOLI DING
- Add To MetaCart
-
Unavoidable Double-Connected Large Graphs
- Submitted to Discrete Mathematics Unavoidable double-connected large graphs Guoli Ding
- Add To MetaCart
-
The Best Expert versus the Smartest Algorithm
- State University, Baton Rouge, Louisiana, 70803, USA June 27, 2003 Abstract Guoli Ding Department
- Add To MetaCart
-
Packing Cycles in Graphs
- Packing Cycles in Graphs Guoli Ding Mathematics Department, Louisiana State University Baton
- Cited by 2 (2 self) – Add To MetaCart
-
Partitioning into graphs with only small components
- PARTITIONING INTO GRAPHS WITH ONLY SMALL COMPONENTS NOGA ALON 1 , GUOLI DING 2 , BOGDAN OPOROWSKI
- Cited by 12 (0 self) – Add To MetaCart
-
The complexity of recognizing linear systems with certain integrality properties
- The Complexity of Recognizing Linear Systems with Certain Integrality Properties Guoli Ding a∗ Li
- Cited by 2 (1 self) – Add To MetaCart
-
UNAVOIDABLE PARALLEL MINORS OF 4-CONNECTED GRAPHS
- CAROLYN CHUN, GUOLI DING, BOGDAN OPOROWSKI, JAMES OXLEY, DIRK VERTIGAN Abstract. In this paper, we prove
- Cited by 1 (1 self) – Add To MetaCart
-
Partitioning into Two Graphs with Only Small Components
- PARTITIONING INTO TWO GRAPHS WITH ONLY SMALL COMPONENTS GUOLI DING 1 , BOGDAN OPOROWSKI 2
- Cited by 1 (1 self) – Add To MetaCart
-
Excluding any graph as a minor allows a low tree-width 2-coloring
- EXCLUDING ANY GRAPH AS A MINOR ALLOWS A LOW TREE-WIDTH 2-COLORING MATT DEVOS, GUOLI DING 1
- Cited by 18 (1 self) – Add To MetaCart

