Mingxian Zhong
Columbia University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Mingxian Zhong.
Journal of Graph Theory | 2017
Maria Chudnovsky; Peter Maceli; Juraj Stacho; Mingxian Zhong
We show that the 4-coloring problem can be solved in polynomial time for graphs with no induced 5-cycle C5 and no induced 6-vertex path P6
Combinatorica | 2018
Flavia Bonomo; Maria Chudnovsky; Peter Maceli; Oliver Schaudt; Maya Steinz; Mingxian Zhong
In this paper we present a polynomial time algorithm that determines if an input graph containing no induced seven-vertex path is 3-colorable. This affirmatively answers a question posed by Randerath, Schiermeyer and Tewes in 2002. Our algorithm also solves the list-coloring version of the 3-coloring problem, where every vertex is assigned a list of colors that is a subset of {1,2,3}, and gives an explicit coloring if one exists.
Discrete Mathematics | 2018
Maria Chudnovsky; Paul D. Seymour; Sophie Spirkl; Mingxian Zhong
Abstract The graphs with no five-vertex induced path are still not understood. But in the triangle-free case, we can do this and one better; we give an explicit construction for all triangle-free graphs with no six-vertex induced path. Here are three examples: the 16-vertex Clebsch graph, the graph obtained from an 8-cycle by making opposite vertices adjacent, and the graph obtained from a complete bipartite graph by subdividing a perfect matching. We show that every connected triangle-free graph with no six-vertex induced path is an induced subgraph of one of these three (modulo some twinning and duplication).
workshop on graph theoretic concepts in computer science | 2017
Maria Chudnovsky; Oliver Schaudt; Sophie Spirkl; Maya Stein; Mingxian Zhong
It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on
arXiv: Discrete Mathematics | 2015
Maria Chudnovsky; Peter Maceli; Mingxian Zhong
t
symposium on discrete algorithms | 2016
Maria Chudnovsky; Jan Goedgebeur; Oliver Schaudt; Mingxian Zhong
vertices, for fixed
arXiv: Combinatorics | 2014
Maria Chudnovsky; Peter Maceli; Mingxian Zhong
t
arXiv: Combinatorics | 2015
Maria Chudnovsky; Jan Goedgebeur; Oliver Schaudt; Mingxian Zhong
. We propose an algorithm that, given a 3-colorable graph without an induced path on
arXiv: Combinatorics | 2018
Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong
t
arXiv: Combinatorics | 2018
Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong
vertices, computes a coloring with