default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGek Ling Chia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Gek Ling Chia, Kai An Sim
:
On the skewness of products of graphs. Discret. Appl. Math. 342: 295-303 (2024)- 2022
- [j34]Niran Abbas Ali, Gek Ling Chia, Hazim Michman Trao, Adem Kiliçman:
Triangulability of convex graphs and convex skewness. Discret. Math. Algorithms Appl. 14(4): 2150146:1-2150146:19 (2022) - [j33]Yu Bin Tai, Gek Ling Chia, Poh-Hwa Ong:
Multi-bridge graphs are anti-magic. Electron. J. Graph Theory Appl. 10(1): 311 (2022) - 2020
- [j32]Gek Ling Chia, Wanida Hemakul, Sirirat Singhun:
Graphs with cyclomatic number three having panconnected square, II. AKCE Int. J. Graphs Comb. 17(3): 911-914 (2020) - [j31]Yip C. Yiew, Gek Ling Chia, Poh-Hwa Ong:
Crossing number of Cartesian product of prism and path. AKCE Int. J. Graphs Comb. 17(3): 1087-1093 (2020)
2010 – 2019
- 2018
- [j30]Gek Ling Chia:
Self-complementary magic squares of doubly even orders. Discret. Math. 341(5): 1359-1362 (2018) - 2017
- [j29]Gek Ling Chia, Wanida Hemakul, Sirirat Singhun:
Graphs with cyclomatic number three having panconnected square. Discret. Math. Algorithms Appl. 9(5): 1750067:1-1750067:14 (2017) - 2015
- [j28]Gek Ling Chia, Chan L. Lee:
Crossing Numbers of Nearly Complete Graphs and Nearly Complete Bipartite Graphs. Ars Comb. 121: 437-446 (2015) - 2014
- [j27]Gek Ling Chia, Angeline Lee:
Self-Complementary Magic Squares. Ars Comb. 114: 449-460 (2014) - 2013
- [j26]Gek Ling Chia, Kai An Sim:
On the skewness of the join of graphs. Discret. Appl. Math. 161(16-17): 2405-2409 (2013) - 2012
- [j25]Gek Ling Chia, Carsten Thomassen:
On the Number of Longest and Almost Longest Cycles in Cubic Graphs. Ars Comb. 104: 307-320 (2012) - [j24]Gek Ling Chia, Poh-Hwa Ong:
On Self-Clique Graphs all of whose Cliques have Equal Size. Ars Comb. 105: 435-449 (2012) - 2011
- [j23]Gek Ling Chia, Carsten Thomassen:
Grinberg's Criterion Applied to Some Non-Planar Graphs. Ars Comb. 100: 3-7 (2011) - [j22]Gek Ling Chia, Wanida Hemakul, Sirirat Singhun:
Graphs with cyclomatic number two having panconnected square. Discret. Math. 311(10-11): 850-855 (2011)
2000 – 2009
- 2009
- [j21]Gek Ling Chia, Chee-Kit Ho:
Chromatic equivalence classes of complete tripartite graphs. Discret. Math. 309(1): 134-143 (2009) - [j20]Gek Ling Chia, Poh-Hwa Ong:
On self-clique graphs with given clique sizes, II. Discret. Math. 309(6): 1538-1547 (2009) - [j19]Gek Ling Chia, Siew-Hui Ong, Li Y. Tan:
On graphs whose square have strong hamiltonian properties. Discret. Math. 309(13): 4608-4613 (2009) - 2006
- [j18]Gek Ling Chia, W. K. Kok:
On non-symmetric commutative association schemes with exactly one pair of non-symmetric relations. Discret. Math. 306(24): 3189-3222 (2006) - [j17]Gek Ling Chia, Poh-Hwa Ong:
Isomorphic factorization of the complete graph into Cayley digraphs. J. Graph Theory 52(3): 243-256 (2006) - 2005
- [j16]Gek Ling Chia, Siew-Hui Ong:
Generalized knight's tours on rectangular chessboards. Discret. Appl. Math. 150(1-3): 80-98 (2005) - [c3]Gek Ling Chia, V. L. Chia:
On the Choice Numbers of Some Complete Multipartite Graphs. CJCDGCGT 2005: 30-37 - 2004
- [j15]Gek Ling Chia, C. S. Gan:
Minimal regular graphs with given girths and crossing numbers. Discuss. Math. Graph Theory 24(2): 223-237 (2004) - 2003
- [c2]Gek Ling Chia, C. L. Lee:
Crossing Numbers and Skewness of Some Generalized Petersen Graphs. IJCCGGT 2003: 80-86 - 2002
- [j14]Gek Ling Chia, Wai Keong Kok:
A Note on Disconnected Weakly k-Homogeneous Graphs. Graphs Comb. 18(4): 723-729 (2002) - [c1]Gek Ling Chia, C. S. Gan:
On Crossing Numbers of 5-Regular Graphs. COCOON 2002: 230-237 - 2001
- [j13]Gek Ling Chia, Chee-Kit Ho:
On the Chromatic Uniqueness of Edge-Gluing of Complete Bipartite Graphs and Cycles. Ars Comb. 60 (2001) - 2000
- [j12]Gek Ling Chia:
On self-clique graphs with given clique sizes. Discret. Math. 212(3): 185-189 (2000)
1990 – 1999
- 1998
- [j11]Gek Ling Chia:
On the chromatic equivalence class of graphs. Discret. Math. 178(1-3): 15-23 (1998) - 1997
- [j10]C. C. Chen, Gek Ling Chia, Khee Meng Koh, N. Z. Li, Kee L. Teo:
Preface. Discret. Math. 172(1-3): 1 (1997) - [j9]Gek Ling Chia:
Some problems on chromatic polynomials. Discret. Math. 172(1-3): 39-44 (1997) - [j8]Gek Ling Chia:
A bibliography on chromatic polynomials. Discret. Math. 172(1-3): 175-191 (1997) - 1996
- [j7]Gek Ling Chia:
The chromaticity of wheels with a missing spoke II. Discret. Math. 148(1-3): 305-310 (1996) - [j6]Gek Ling Chia:
On graphs uniquely colorable under the action of their automorphism groups. Discret. Math. 162(1-3): 281-284 (1996) - [j5]Gek Ling Chia:
On the chromatic equivalence class of a family of graphs. Discret. Math. 162(1-3): 285-289 (1996) - 1995
- [j4]Gek Ling Chia:
On the join of graphs and chromatic uniqueness. J. Graph Theory 19(2): 251-261 (1995) - 1994
- [j3]Ranko Scepanovic, Gerhard Ringel, Dragan Marusic, Gek Ling Chia, Brian Alspach:
Nonseparable graphs with a given number of cycles. J. Graph Theory 18(8): 777-789 (1994) - 1990
- [j2]Gek Ling Chia:
The chromaticity of wheels with a missing spoke. Discret. Math. 82(2): 209-212 (1990)
1980 – 1989
- 1986
- [j1]Gek Ling Chia, Chong-Keang Lim:
A class of self-complementary vertex-transitive digraphs. J. Graph Theory 10(2): 241-249 (1986)
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-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
