default search action
Kee L. Teo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j22]Jianfeng Wang, Kee L. Teo, Qiongxiang Huang, Chengfu Ye, Ruying Liu:
A new expression for the adjoint polynomial of a path. Australas. J Comb. 43: 103-114 (2009) - 2004
- [j21]Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little:
Graph-functions associated with an edge-property. Australas. J Comb. 30: 3-20 (2004) - [j20]Feng Ming Dong
, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh:
Chromatically Unique Multibridge Graphs. Electron. J. Comb. 11(1) (2004) - [j19]Serguei Norine, Charles H. C. Little, Kee L. Teo:
A new proof of a characterisation of Pfaffian bipartite graphs. J. Comb. Theory B 91(1): 123-126 (2004) - 2002
- [j18]Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
Two invariants for adjointly equivalent graphs. Australas. J Comb. 25: 133-144 (2002) - [j17]Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
Zeros of adjoint polynomials of paths and cycles. Australas. J Comb. 25: 167-174 (2002) - [j16]Feng Ming Dong
A note on the chromaticity of some 2-connected (n, n+3)-graphs. Discret. Math. 243(1-3): 217-221 (2002) - [j15]Feng Ming Dong
Non-chordal graphs having integral-root chromatic polynomials II. Discret. Math. 245(1-3): 247-253 (2002) - [j14]Feng Ming Dong
The vertex-cover polynomial of a graph. Discret. Math. 250(1-3): 71-78 (2002) - [j13]Feng Ming Dong
Chromaticity of some families of dense graphs. Discret. Math. 258(1-3): 303-321 (2002) - 2001
- [j12]Feng Ming Dong
Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs. Graphs Comb. 17(4): 611-635 (2001) - [j11]Feng Ming Dong
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs. J. Graph Theory 37(1): 48-77 (2001) - 2000
- [j10]Feng Ming Dong
An attempt to classify bipartite graphs by chromatic polynomials. Discret. Math. 222(1-3): 73-88 (2000) - [j9]Feng Ming Dong
Chromatically unique bipartite graphs with low 3-independent partition numbers. Discret. Math. 224(1-3): 107-124 (2000)
1990 – 1999
- 1997
- [j8]C. C. Chen, Gek Ling Chia, Khee Meng Koh, N. Z. Li, Kee L. Teo:
Preface. Discret. Math. 172(1-3): 1 (1997) - [j7]Khee Meng Koh, Kee L. Teo:
The search for chromatically unique graphs - II. Discret. Math. 172(1-3): 59-78 (1997) - [j6]Yee-Hock Peng, C. H. C. Little, Kee L. Teo, Hong Wang:
Chromatic equivalence classes of certain generalized polygon trees. Discret. Math. 172(1-3): 103-114 (1997) - [j5]Charles H. C. Little, Kee L. Teo, Hong Wang:
On a Conjecture on Directed Cycles in a Directed Bipartite Graph. Graphs Comb. 13(3): 267-273 (1997) - 1996
- [j4]Hong Wang, Charles H. C. Little, Kee L. Teo:
Partition of a directed bipartite graph into two directed cycles. Discret. Math. 160(1-3): 283-289 (1996) - 1994
- [j3]Khee Meng Koh, Kee L. Teo:
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles. Discret. Math. 127(1-3): 243-258 (1994) - 1990
- [j2]Khee Meng Koh, Kee L. Teo:
The search for chromatically unique graphs. Graphs Comb. 6(3): 259-285 (1990)
1980 – 1989
- 1989
- [j1]Khee Meng Koh, Kee L. Teo:
The 2-hamiltonian cubes of graphs. J. Graph Theory 13(6): 737-747 (1989)
Coauthor Index
aka: Feng Ming Dong
aka: C. H. C. Little
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-06-10 20:31 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: