Ming Han

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Every planar graph is 1-defective <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e199" altimg="si22.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-paintable	2021	Ming Han H. A. Kierstead Xuding Zhu
+	Defective 3-Paintability of Planar Graphs	2018	Grzegorz Gutowski Ming Han Tomasz Krawczyk Xuding Zhu
+	Defective 3-Paintability of Planar Graphs	2017	Grzegorz Gutowski Ming Han Tomasz Krawczyk Xuding Zhu
+	Every planar graph is $1$-defective $(9,2)$-paintable	2016	Ming Han Xuding Zhu

Common Coauthors

Coauthor	Papers Together
Xuding Zhu	4
Tomasz Krawczyk	2
Grzegorz Gutowski	2
H. A. Kierstead	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Every Planar Graph Is 5-Choosable	1994	Carsten Thomassen	3
+	Defective 3-Paintability of Planar Graphs	2018	Grzegorz Gutowski Ming Han Tomasz Krawczyk Xuding Zhu	1
+	Planar graphs are 9/2-colorable	2018	Daniel W. Cranston Landon Rabern	1
+	Multiple list colouring of planar graphs	2016	Xuding Zhu	1
+	The Alon-Tarsi number of a planar graph minus a matching	2020	Jarosław Grytczuk Xuding Zhu	1