default search action
Gee-Choon Lau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Gee-Choon Lau, K. Premalatha, S. Arumugam, Wai Chee Shiu:
On local antimagic chromatic number of cycle-related join graphs II. Discret. Math. Algorithms Appl. 16(3): 2350022:1-2350022:18 (2024) - 2023
- [j23]J. Maria Jeyaseeli, Gee-Choon Lau, Wai Chee Shiu, S. Arumugam:
Sudoku number of graphs. AKCE Int. J. Graphs Comb. 20(2): 209-216 (2023) - [j22]Gee-Choon Lau, Jianxi Li, Wai-Chee Shiu:
Approaches that output infinitely many graphs with small local antimagic chromatic number. Discret. Math. Algorithms Appl. 15(2): 2250079:1-2250079:25 (2023) - 2022
- [j21]Gee-Choon Lau, Saeid Alikhani:
More on the unimodality of domination polynomial of a graph. Discret. Math. Algorithms Appl. 14(4): 2150138:1-2150138:9 (2022) - 2021
- [j20]Gee-Choon Lau, Ho-Kuen Ng, Wai-Chee Shiu:
On local antimagic chromatic number of cycle-related join graphs. Discuss. Math. Graph Theory 41(1): 133-152 (2021) - [j19]Zhen-Bin Gao, Gee-Choon Lau, Wai-Chee Shiu:
Graphs with Minimal Strength. Symmetry 13(3): 513 (2021) - [j18]Wai-Chee Shiu, Gee-Choon Lau:
On SD-Prime Labelings of Some One Point Unions of Gears. Symmetry 13(5): 849 (2021) - 2020
- [j17]Ibrahim Tarawneh, Roslan Hasni, Ali Ahmad, Gee-Choon Lau, Sin-Min Lee:
On the edge irregularity strength of corona product of graphs with cycle. Discret. Math. Algorithms Appl. 12(6): 2050083:1-2050083:18 (2020) - [j16]Gee-Choon Lau, Ho-Kuen Ng, Wai-Chee Shiu:
Affirmative Solutions on Local Antimagic Chromatic Number. Graphs Comb. 36(5): 1337-1354 (2020)
2010 – 2019
- 2016
- [j15]Gee-Choon Lau, Zhen-Bin Gao, Sin-Min Lee, Guang-Yi Sun:
On friendly index sets of the edge-gluing of complete graph and cycles. AKCE Int. J. Graphs Comb. 13(2): 107-111 (2016) - [j14]Gee-Choon Lau, Wai Chee Shiu, Ho-Kuen Ng:
Further results on super graceful labeling of graphs. AKCE Int. J. Graphs Comb. 13(2): 200-209 (2016) - [j13]N. S. A. Karim, Roslan Hasni, Gee-Choon Lau:
Chromatically unique 6-bridge graph theta(a, a, a, b, b, c). Electron. J. Graph Theory Appl. 4(1): 60-78 (2016) - 2015
- [j12]Gee-Choon Lau, Saeid Alikhani, Sin-Min Lee, William L. Kocay:
On k-edge-magic labelings of maximal outerplanar graphs. AKCE Int. J. Graphs Comb. 12(1): 40-46 (2015) - [j11]P. Jeyanthi, N. Angel Benseera, Gee-Choon Lau:
On k-totally magic cordial labeling of graphs. Discret. Math. Algorithms Appl. 7(3): 1550024:1-1550024:7 (2015) - [j10]P. Jeyanthi, T. Saratha Devi, Gee-Choon Lau:
Some results on edge pair sum labeling. Electron. Notes Discret. Math. 48: 169-173 (2015) - 2014
- [j9]Saeid Alikhani, William L. Kocay, Gee-Choon Lau, Sin-Min Lee:
On the k-edge magic graphs. Electron. Notes Discret. Math. 45: 35-41 (2014) - 2011
- [j8]Gee-Choon Lau, Y. H. Peng, H. H. Chu:
Chromatic Uniqueness of Certain Complete 4-partite Graphs. Ars Comb. 99: 377-382 (2011) - 2010
- [j7]Gee-Choon Lau, Yee-Hock Peng:
Chromaticity of Turán Graphs with Certain Matching or Star Deleted. Ars Comb. 94 (2010) - [j6]Gee-Choon Lau, Y. H. Peng, Kamel Ariffin Mohd Atan:
Chromaticity of Complete Tripartite Graphs With Certain Star or Matching Deleted. Ars Comb. 97 (2010)
2000 – 2009
- 2009
- [j5]Gee-Choon Lau, Y. H. Peng:
Chromatic Uniqueness Of Certain Complete t-partite Graphs. Ars Comb. 92 (2009) - [j4]Y. H. Peng, Gee-Choon Lau:
Chromatic classes of 2-connected (n, n+4)-graphs with three triangles and one induced 4-cycle. Discret. Math. 309(10): 3092-3101 (2009) - [j3]Gee-Choon Lau, Y. H. Peng:
On the chromaticity of complete multipartite graphs with certain edges added. Discret. Math. 309(12): 4089-4094 (2009) - 2006
- [j2]Gee-Choon Lau, Y. H. Peng:
Chromaticity of certain tripartite graphs identified with a path. Discret. Math. 306(22): 2893-2900 (2006) - 2004
- [j1]Y. H. Peng, Gee-Choon Lau:
Chromatic classes of 2-connected (n, n+4)-graphs with at least four triangles. Discret. Math. 278(1-3): 209-218 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-15 23:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint