The following pages link to Gerard Jennhwa Chang (Q400523):
Displaying 50 items.
- On the number of SDR of a (t,n)-family (Q1119579) (← links)
- Total domination in block graphs (Q1124531) (← links)
- Group testing with two defectives (Q1164364) (← links)
- R-domination of block graphs (Q1171499) (← links)
- Centers of chordal graphs (Q1180670) (← links)
- Set to set broadcasting in communication networks (Q1208457) (← links)
- Circular chromatic numbers and fractional chromatic numbers of distance graphs (Q1266350) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- The path-partition problem in bipartite distance-hereditary graphs (Q1272711) (← links)
- Generalized diameters and Rabin numbers of networks (Q1288475) (← links)
- Sortabilities of partition properties (Q1288482) (← links)
- Localizing combinatorial properties for partitions on block graphs (Q1288483) (← links)
- The \(\beta\)-assignment problems (Q1291693) (← links)
- Reliabilities for \((n,f,k)\) systems (Q1292777) (← links)
- The number of maximal independent sets in connected triangle-free graphs (Q1292823) (← links)
- Rabin numbers of Butterfly networks (Q1297411) (← links)
- Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
- Algorithmic aspects of linear \(k\)-arboricity (Q1301997) (← links)
- Wide diameters of butterfly networks (Q1301998) (← links)
- Fault-tolerant routing in circulant networks and cycle prefix networks (Q1305199) (← links)
- Distance graphs and \(T\)-coloring (Q1305534) (← links)
- The domatic number problem (Q1322260) (← links)
- Edge domatic numbers of complete \(n\)-partite graphs (Q1340123) (← links)
- The path-partition problem in block graphs (Q1342260) (← links)
- The exact gossiping problem (Q1356537) (← links)
- Proper interval graphs and the guard problem (Q1363667) (← links)
- Medians of graphs and kings of tournaments (Q1365336) (← links)
- The Hamiltonian property of the consecutive-3 digraphs (Q1368420) (← links)
- The \(\beta\)-assignment problem in general graphs (Q1370666) (← links)
- Algorithmic aspects of majority domination (Q1371054) (← links)
- Maximal independent sets in graphs with at most one cycle (Q1372731) (← links)
- \(k\)-path partitions in trees (Q1377668) (← links)
- Enumerating consecutive and nested partitions for graphs (Q1378295) (← links)
- Interval numbers of powers of block graphs (Q1420587) (← links)
- Geodetic spectra of graphs. (Q1427436) (← links)
- Linear \(k\)-arboricities on trees (Q1570841) (← links)
- Group testing in bipartite graphs (Q1607719) (← links)
- \(k\)-subdomination in graphs (Q1613364) (← links)
- Total interval numbers of complete \(r\)-partite graphs (Q1613415) (← links)
- On the precise value of the strong chromatic index of a planar graph with a large girth (Q1671365) (← links)
- A short proof for Chen's alternative Kneser coloring lemma (Q1758510) (← links)
- Path partition for graphs with special blocks (Q1765521) (← links)
- \(T\)-colorings and \(T\)-edge spans of graphs (Q1808715) (← links)
- An upper bound for the transversal numbers of 4-uniform hypergraphs (Q1813333) (← links)
- A note on the Gallai-Roy-Vitaver theorem (Q1849952) (← links)
- Corrigendum to ``The path-partition problem in block graphs''. (Q1853086) (← links)
- Algorithmic aspect of \(k\)-tuple domination in graphs. (Q1860929) (← links)
- Distance-two labelings of graphs (Q1869030) (← links)
- Centers and medians of distance-hereditary graphs (Q1874367) (← links)
- The weighted independent domination problem is NP-complete for chordal graphs (Q1887072) (← links)
