550 citations
- High Energy Accelerator Research OrganizationJP24 papers
- The Graduate University for Advanced Studies, SOKENDAIJP24 papers
- National Central UniversityTW23 papers
- The University of SydneyAU23 papers
- Yonsei UniversityKR23 papers
- Budker Institute of Nuclear PhysicsRU22 papers
- National United UniversityTW22 papers
- Panjab UniversityIN22 papers
- Sungkyunkwan UniversityKR22 papers
- The University of MelbourneAU22 papers
- The University of OsakaJP22 papers
- The University of TokyoJP22 papers
Showing math.COShow all
3 papers · 1 filter
math.CO2004
A note on equitable colorings of forests
Gerard J. Chang
This note gives a short proof on characterizations of a forest to be equitably k-colorable.
math.CO2004★ 1 cited
Distance-two labelings of digraphs
G. J. Chang, J. -J. Chen, D. Kuo +1
For positive integers , an -labeling of a digraph is a function from into the set of nonnegative integers such that if is adja…
math.CO2003
Isometric path numbers of graphs
Jun-Jie Pan, Gerard J. Chang
An isometric path between two vertices in a graph is a shortest path joining them. The isometric path number of , denoted by $\ip(G)$, is the minimum number of isometric pat…