dblp.uni-trier.dewww.uni-trier.de

Young Soo Kwon

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
10EEMarston D. E. Conder, Young Soo Kwon, Jozef Sirán: Reflexibility of regular Cayley maps for abelian groups. J. Comb. Theory, Ser. B 99(1): 254-260 (2009)
2008
9EEJin Ho Kwak, Young Soo Kwon: Classification of reflexible regular embeddings and self-Petrie dual regular embeddings of complete bipartite graphs. Discrete Mathematics 308(11): 2156-2166 (2008)
8EEJin Ho Kwak, Young Soo Kwon, Ju-Mok Oh: Infinitely many one-regular Cayley graphs on dihedral groups of any prescribed valency. J. Comb. Theory, Ser. B 98(3): 585-598 (2008)
2007
7EEYoung Soo Kwon, Roman Nedela: Non-existence of nonorientable regular embeddings of n-dimensional cubes. Discrete Mathematics 307(3-5): 511-516 (2007)
6EEMark Bilinski, Young Soo Kwon, Xingxing Yu: On the reconstruction of planar graphs. J. Comb. Theory, Ser. B 97(5): 745-756 (2007)
5EERongquan Feng, Jin Ho Kwak, Young Soo Kwon: Erratum: Enumerating Typical Circulant Covering Projections onto a Circulant Graph. SIAM J. Discrete Math. 21(2): 548-550 (2007)
2006
4EEJin Ho Kwak, Young Soo Kwon, Rongquan Feng: A classification of regular t-balanced Cayley maps on dihedral groups. Eur. J. Comb. 27(3): 382-393 (2006)
2005
3EEJin Ho Kwak, Young Soo Kwon: Regular orientable embeddings of complete bipartite graphs. Journal of Graph Theory 50(2): 105-122 (2005)
2EERongquan Feng, Jin Ho Kwak, Young Soo Kwon: Enumerating Typical Circulant Covering Projections Onto a Circulant Graph. SIAM J. Discrete Math. 19(1): 196-207 (2005)
2004
1EEYoung Soo Kwon: New regular embeddings of n-cubes Qn. Journal of Graph Theory 46(4): 297-312 (2004)

Coauthor Index

1Mark Bilinski [6]
2Marston D. E. Conder [10]
3Rongquan Feng [2] [4] [5]
4Jin Ho Kwak [2] [3] [4] [5] [8] [9]
5Roman Nedela [7]
6Ju-Mok Oh [8]
7Jozef Sirán [10]
8Xingxing Yu [6]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)