Young Soo Kwon

Prof. Young Soo Kwon


Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 1996 in Journal of Engineering Materials and Technology
Verified
Journal Article
Closed access
PDF file
YKYoung Soo Kwon
Young Soo Kwon
KKK. T. Kim
K. T. Kim
Densification and grain growth of alumina powder compacts were investigated under pressureless sintering, sinter forging, and hot pressing. A set of constitutive equations by Kwon et al. was used to predict densification under diffusional creep. A novel grain growth equation is proposed by generalizing the grain growth model of Wilkinson and Ca´ceres to predict grain growth during densification forming process of ceramic powders under general loading states. Material parameters in the constitutive equations were determined from experimental data under pressureless sintering and sinter forging. Theoretical predictions by using the constitutive equations for creep densification and grain growth were compared with experimental data of alumina powder compacts.

28 September 2011 in Chemistry – A European Journal
Verified
Journal Article
Closed access
PDF file
KLKum Hee Lee
Kum Hee Lee
YKYoung Soo Kwon
Young Soo Kwon
JLJi Ha Lee
Ji Ha Lee
SKSunwoo Kang
Sunwoo Kang
KYKyoung Soo Yook
Kyoung Soo Yook
SYSeung Soo Yoon
Seung Soo Yoon

9 July 2010 in Journal of Algebraic Combinatorics
Verified
Journal Article
Closed access
PDF file
DCDomenico Catalano
Domenico Catalano
MCMarston D. E. Conder
Marston D. E. Conder
SDShao Fei Du
Shao Fei Du
YKYoung Soo Kwon
Young Soo Kwon
RNRoman Nedela
Roman Nedela
SWStephen Wilson
Stephen Wilson

2 May 2016 in Journal of Algebraic Combinatorics
Verified
Journal Article
Closed access
PDF file
IKIstvan Kovács
Istvan Kovács
ISIstván
István
YKYoung Soo Kwon
Young Soo Kwon

15 February 2012 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
SKSeog-Jin Kim
Seog-Jin Kim
YKYoung Soo Kwon
Young Soo Kwon
DLDaphne Der-Fen Liu
Daphne Der-Fen Liu
XZXuding Zhu
Xuding Zhu
The Ohba Conjecture says that every graph $G$ with $|V(G)| \le 2 \chi(G)+1$ is chromatic choosable. This paper studies an on-line version of Ohba Conjecture. We prove that unlike the off-line case, for $k \ge 3$, the complete multipartite graph $K_{2\star (k-1), 3}$ is not on-line chromatic-choosable. Based on this result, the on-line version of Ohba Conjecture is modified as follows: Every graph $G$ with $|V(G)| \le 2 \chi(G)$ is on-line chromatic choosable. We present an explicit strategy to show that for any positive integer $k$, the graph $K_{2\star k}$ is on-line chromatic-choosable. We then present a minimal function $g$ for which the graph $K_{2 \star (k-1), 3}$ is on-line $g$-choosable.

1 January 1990 in Powder Metallurgy
Verified
Journal Article
Closed access
KKK. T. Kim
K. T. Kim
JSJEONG SUH
JEONG SUH
YKYoung Soo Kwon
Young Soo Kwon