The following pages link to Gerard Jennhwa Chang (Q400523):
Displaying 50 items.
- (Q3818327) (← links)
- (Q3835465) (← links)
- Complete Diagonals of Latin Squares (Q3859778) (← links)
- (Q3960885) (← links)
- A Group Testing Problem (Q3964572) (← links)
- A Group Testing Problem on Two Disjoint Sets (Q3964573) (← links)
- An existence theorem for abstract stable sets (Q3988082) (← links)
- (Q4020464) (← links)
- (Q4182573) (← links)
- <i>k</i>-Neighborhood-Covering and -Independence Problems for Chordal Graphs (Q4210228) (← links)
- (Q4232775) (← links)
- Onk-ary spanning trees of tournaments (Q4237726) (← links)
- (Q4239764) (← links)
- The consecutive-4 digraphs are Hamiltonian (Q4242729) (← links)
- (Q4247463) (← links)
- Characterizing bit permutation networks (Q4262015) (← links)
- The circular chromatic number of the Mycielskian ofGdk (Q4265588) (← links)
- (Q4268431) (← links)
- (Q4309148) (← links)
- The <i>w</i>‐median of a connected strongly chordal graph (Q4312245) (← links)
- Integral distance graphs (Q4351316) (← links)
- Optimality of consecutive and nested tree partitions (Q4361177) (← links)
- A unique arithmetic labeling of hexagonal lattices (Q4373376) (← links)
- (Q4385251) (← links)
- A simple and direct derivation for the number of noncrossing partitions (Q4387024) (← links)
- (Q4486258) (← links)
- (Q4515736) (← links)
- (t, k) - Diagnosis for Matching Composition Networks under the MM* Model (Q4564100) (← links)
- (Q4736226) (← links)
- The edge domination problem (Q4846685) (← links)
- Strong Chromatic Index of 2-Degenerate Graphs (Q4920654) (← links)
- (Q4943526) (← links)
- CORRIGENDA ON “NEW COMPARISONS IN BIRNBAUM IMPORTANCE FOR THE CONSECUTIVE-<i>k</i>-OUT-OF-<i>n</i> SYSTEM” (Q4955529) (← links)
- Algorithmic Aspects of Neighborhood Numbers (Q5285934) (← links)
- Total Weight Choosability of Trees (Q5346547) (← links)
- (Q5403041) (← links)
- A managed Bayesian risk approach for decision making alternatives (Q5453875) (← links)
- (Q5461468) (← links)
- (Q5461588) (← links)
- (Q5466046) (← links)
- STACS 2005 (Q5710704) (← links)
- The Domatic Number Problem in Interval Graphs (Q5749323) (← links)
- Bipartite Steinhaus graphs (Q5916329) (← links)
- The number of maximum independent sets in graphs (Q5928418) (← links)
- The \(K_r\)-packing problem (Q5937570) (← links)
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)
- Channel graphs of bit permutation networks (Q5941508) (← links)
- Families of graphs closed under taking powers (Q5943040) (← links)
- Domination in distance-hereditary graphs (Q5957300) (← links)
- Max-coloring of vertex-weighted graphs (Q5964985) (← links)
