![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Y. H. Peng
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2011
- [j17]Roslan Hasni, Y. H. Peng:
Chromatic Uniqueness of Complete Bipartite Graphs With Certain Edges Deleted. Ars Comb. 98: 203-213 (2011) - [j16]Roslan Hasni, Y. H. Peng:
Chromaticity of Bipartite Graphs With Seven Edges Deleted. Ars Comb. 99: 257-277 (2011) - [j15]Gee-Choon Lau, Y. H. Peng, H. H. Chu:
Chromatic Uniqueness of Certain Complete 4-partite Graphs. Ars Comb. 99: 377-382 (2011) - [j14]L. M. Li, D. Y. Li, Y. H. Peng:
The simulation of sheet metal forming processes via integrating solid-shell element with explicit finite element method. Eng. Comput. 27(3): 273-284 (2011) - 2010
- [j13]A. M. Khalaf, Y. H. Peng:
A Family of Chromatically Unique 6-bridge Graphs. Ars Comb. 94 (2010) - [j12]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) - 2009
- [j11]Gee-Choon Lau, Y. H. Peng:
Chromatic Uniqueness Of Certain Complete t-partite Graphs. Ars Comb. 92 (2009) - [j10]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) - [j9]Gee-Choon Lau
, Y. H. Peng:
On the chromaticity of complete multipartite graphs with certain edges added. Discret. Math. 309(12): 4089-4094 (2009) - 2008
- [j8]Y. H. Peng, Z. W. Yin:
The algorithms for trimmed surfaces construction and tool path generation in reverse engineering. Comput. Ind. Eng. 54(3): 624-633 (2008) - 2006
- [j7]Gee-Choon Lau
, Y. H. Peng:
Chromaticity of certain tripartite graphs identified with a path. Discret. Math. 306(22): 2893-2900 (2006) - [j6]D. Y. Li, Y. H. Peng, Z. W. Yin:
Interference detection for direct tool path generation from measured data points. Eng. Comput. 22(1): 25-31 (2006) - 2004
- [j5]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) - 1993
- [j4]C. C. Chen, Khee Meng Koh, Y. H. Peng:
On the higher-order edge toughness of a graph. Discret. Math. 111(1-3): 113-123 (1993) - [j3]Y. H. Peng, T. S. Tay:
On the edge-toughness of a graph. II. J. Graph Theory 17(2): 233-246 (1993) - 1991
- [j2]Y. H. Peng:
On the chromatic uniqueness of certain bipartite graphs. Discret. Math. 94(2): 129-140 (1991) - 1989
- [j1]Y. H. Peng, C. C. Chen, Khee Meng Koh:
On the factor-thickness of regular graphs. Graphs Comb. 5(1): 173-188 (1989)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-05-08 21:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint