Ping Wang
St. Francis Xavier University
21 Papers
46 Citations
Ping Wang is an academic researcher from St. Francis Xavier University. The author has contributed to research in topics: Planar graph & Edge coloring. The author has an hindex of 8, co-authored 20 publications. Previous affiliations of Ping Wang include University of Regina.
Chat about Author
Papers
Acyclic chromatic indices of planar graphs with large girth
TL;DR: It is proved that every planar graph G with girth g(G) and maximum degree @D has a^'(G)[email protected] if there exists a pair (k,m)@?{(3,11),(4,8),(5,7),(8,6)} such that G satisfies @D>=k and g( G)>=m.
17
A lower bound of the surviving rate of a planar graph with girth at least seven
TL;DR: It is shown that if G is a planar graph with n≥2 vertices and having girth at least 7, then $\rho(G)>\frac{1}{301}$.
15
Encoding multiple inheritance hierarchies for lattice operations
M. F. van Bommel,Ping Wang +1 more
- 01 Aug 2004
TL;DR: A new method is proposed, based on the top-down encoding of Caseau but without the lattice completion requirement, which permits incremental updates to the hierarchy to add nodes at the leaves, and supports efficient lattice computations in applications where the classes of objects are stored as codes.
10
Strong chromatic index of K4-minor free graphs
TL;DR: It is proved that if G is a K 4 -minor free graph with maximum degree Δ ≥ 3, then χ s ′ ( G ) ≤ 3 Δ − 2 for any given integer Δ ≥3.
6
An economic efficiency study on different regions of Ghana via Slack-based data envelopment analysis and regression analysis
TL;DR: In this article, slack-based data envelopment analysis, a nonparametric linear programming technique, was used to evaluate the efficiency of the 10 different regions of Ghana using slack data envelope analysis, and various regression models using bootstrap sampling technique.
5