Ping Zhang 0004

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Chira Lumduanhom

> Home > Persons > Ping Zhang 0004

Publications

2018
[j72]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/arscom/JohnstonLZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/JohnstonLZ18
Daniel Johnston, Chira Lumduanhom, Ping Zhang:
On k-Ramsey Numbers of Unicyclic-Star Graphs. Ars Comb. 137: 203-220 (2018)
2017
[j66]
- view
  authority control:
- export record
  dblp key:
  - journals/gc/AndrewsCLZ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/AndrewsCLZ17
Eric Andrews, Gary Chartrand, Chira Lumduanhom, Ping Zhang:
Stars and Their k-Ramsey Numbers. Graphs Comb. 33(2): 257-274 (2017)
2016
[j65]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dmgt/LaforgeL016
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmgt/LaforgeL016
Elliot Laforge, Chira Lumduanhom, Ping Zhang:
Characterizations of graphs having large proper connection numbers. Discuss. Math. Graph Theory 36(2): 439-453 (2016)
2014
[j62]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dmgt/AndrewsLZ14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmgt/AndrewsLZ14
Eric Andrews, Chira Lumduanhom, Ping Zhang:
On Eulerian irregularity in graphs. Discuss. Math. Graph Theory 34(2): 391-408 (2014)

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.