Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. Collins, K.L., Trenk, A.: The distinguishing chromatic number. Electron. J. Combin. 13(1), R16 (2006)
2. Fijavž, G., Negami, S., Sano, T.: 3-Connected planar graphs are 5-distinguishing colorable with two exceptions. Ars Mathematica Contemporanea 4(1), 165–175 (2011)
3. Fijavž, G., Negami, S., Sano, T.: Distinguishing colorings of 3-connected planar graphs with five colors. Yokohama Math. J. 61, 57–65 (2011)
4. Negami, S.: Uniqueness and faithfulness of embedding of toroidal graphs. Discrete Math. 44, 161–180 (1983)
5. Negami, S., Sakurai, S.: Distinguishing chromatic numbers of planar graphs. Yokohama Math. J. 55, 179–188 (2010)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献