Concepedia

Mingxian Zhong

MZ

7

Publications

165

Citations

7

H-Index

2014

Active since

Affiliations

Princeton University(Current)

Columbia University

University of Cologne

Ghent University Hospital

Mingxian Zhong is an author at Princeton University specializing in discrete mathematics, graph theory, and computational complexity.

Top concepts

Graph TheoryDiscrete MathematicsComputational ComplexityComputational GeometryEngineeringComputer ScienceCombinatorial Optimization

Publications per year

2014–2019

7

Publications

7

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices

Flavia Bonomo, Maria Chudnovsky, Peter Maceli et al. · COMBINATORICA · 2017 · 79 citations

Geometric Graph Theory, Graph Theory, Algebraic Graph Theory +6

Three-coloring graphs with no induced seven-vertex path II : using a triangle

Maria Chudnovsky, Peter Maceli, Mingxian Zhong · arXiv (Cornell University) · 2015 · 17 citations · Full text

Geometric Graph Theory, Graph Theory, Topological Graph Theory +11

Three-coloring graphs with no induced seven-vertex path I : the triangle-free case

Maria Chudnovsky, Peter Maceli, Mingxian Zhong · arXiv (Cornell University) · 2014 · 16 citations · Full text

Geometric Graph Theory, Graph Theory, Algebraic Graph Theory +12

Obstructions for three-coloring graphs without induced paths on six vertices

Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt et al. · Journal of Combinatorial Theory Series B · 2019 · 15 citations · Full text

Geometric Graph Theory, Graph Theory, Algebraic Graph Theory +5

Obstructions for three-coloring graphs with one forbidden induced subgraph

Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt et al. · 2015 · 14 citations

Rows per page

1–5 of 7