Projects
Reading
People
Chat
SU\G
(đ¸)
/K¡U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Mu-Tsun Tsai
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
PDF
Chat
Three topics in online list coloring
2014
James M. Carraher
Sarah Loeb
Thomas A. Mahoney
Gregory J. Puleo
Mu-Tsun Tsai
Douglas B. West
+
ON THE SUM OF CONSECUTIVE INTEGERS IN SEQUENCES II
2012
Mu-Tsun Tsai
Alexandru Zaharescu
Common Coauthors
Coauthor
Papers Together
Douglas B. West
1
Gregory J. Puleo
1
Alexandru Zaharescu
1
Thomas A. Mahoney
1
Sarah Loeb
1
James M. Carraher
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
Towards on-line Ohba's conjecture
2011
Jakub Kozik
Piotr Micek
Xuding Zhu
1
+
Towards an on-line version of Ohbaâs conjecture
2013
Jakub Kozik
Piotr Micek
Xuding Zhu
1
+
PDF
Chat
Brooksâ Theorem via the AlonâTarsi Theorem
2010
Jan HladkĂ˝
Daniel KrĂĄÄž
Uwe Schauz
1
+
On the choosability of complete multipartite graphs with part size three
2000
H. A. Kierstead
1
+
Critically paintable, choosable or colorable graphs
2012
Ayesha Riasat
Uwe Schauz
1
+
Improved bounds and algorithms for hypergraph 2-coloring
2000
Jaikumar Radhakrishnan
Aravind Srinivasan
1
+
PDF
Chat
An effective asymptotic formula for the Stieltjes constants
2010
Charles Knessl
Mark W. Coffey
1
+
ON THE SUM OF CONSECUTIVE INTEGERS IN SEQUENCES
2011
Mu-Tsun Tsai
Alexandru Zaharescu
1
+
List Colouring When The Chromatic Number Is Close To the Order Of The Graph
2004
Bruce Reed
Benny Sudakov
1
+
Ohbaâs conjecture for graphs with independence number five
2011
Alexandr Kostochka
Michael Stiebitz
Douglas R. Woodall
1
+
None
2002
1
+
PDF
Chat
On the Sum of Consecutive Primes
1963
Leo Moser
1
+
Graduate Texts in Mathematics
2020
J. H. van Lint
1
+
On chromaticâchoosable graphs
2002
Kyoji Ohba
1
+
Improved bounds and algorithms for hypergraph 2âcoloring
2000
Jaikumar Radhakrishnan
Aravind Srinivasan
1