default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHian Poh Yap
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2005
[j17]Zi-Xia Song, H. P. Yap:
Chromatic Index Critical Graphs of Even Order with Five Major Vertices. Graphs Comb. 21(2): 239-246 (2005)- 2000
- [j16]Qi Zhang Liu
, H. P. Yap:
Edge colorings of K2n with a prescribed condition - I. Discret. Math. 212(3): 233-244 (2000) - 1999
- [j15]H. P. Yap, Qi Zhang Liu:
Edge Colouring of K2n with Spanning Star-Forests Receiving Distinct Colours. Graphs Comb. 15(2): 249-255 (1999) - [j14]Qi Zhang Liu, H. P. Yap:
Proof of a conjecture of Alan Hartman. J. Graph Theory 30(1): 7-17 (1999) - 1995
- [j13]H. P. Yap:
Generalization of two results of Hilton on total-colourings of a graph. Discret. Math. 140(1-3): 245-252 (1995) - 1992
- [j12]K. H. Chew, H. P. Yap:
Total chromatic number of complete r-partite graphs. J. Graph Theory 16(6): 629-634 (1992) - 1990
- [j11]H. P. Yap:
Corrigendum to: on graphs critical with respect to edge-colourings. Discret. Math. 80(2): 223 (1990) - [j10]S. K. Teo, H. P. Yap:
Packing two graphs of ordern having total size at most 2n - 2. Graphs Comb. 6(2): 197-205 (1990) - 1988
- [j9]H. P. Yap:
Packing of graphs - a survey. Discret. Math. 72(1-3): 395-404 (1988) - 1987
- [j8]S. K. Teo, H. P. Yap:
Two Theorems on Packings of Graphs. Eur. J. Comb. 8(2): 199-207 (1987) - 1985
- [j7]Peter J. Slater, S. K. Teo, H. P. Yap:
Packing a tree with a graph of the same size. J. Graph Theory 9(2): 213-216 (1985) - 1983
- [j6]Amanda G. Chetwynd, H. P. Yap:
Chromatic index critical graphs of order 9. Discret. Math. 47: 23-33 (1983) - 1981
- [j5]Hian Poh Yap:
On graphs whose maximal subgraphs have at most two orbits. Discret. Math. 37(2-3): 279-287 (1981) - [j4]Hian Poh Yap:
On graphs critical with respect to edge-colourings. Discret. Math. 37(2-3): 289-296 (1981) - [j3]Hian Poh Yap:
A construction of chromatic index critical graphs. J. Graph Theory 5(2): 159-163 (1981) - 1980
- [j2]Hian Poh Yap:
On the critical graph conjecture. J. Graph Theory 4(3): 309-314 (1980) - 1977
- [j1]H. P. Yap:
Some remarks on E-minimal graphs. Discret. Math. 18(1): 87-92 (1977)
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-04-24 23:06 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:
