The following pages link to Gerard Jennhwa Chang (Q400523):
Displaying 50 items.
- Vertex and tree arboricities of graphs (Q1888169) (← links)
- Corrigendum to ``A comparison theorem for permanents and a proof of a conjecture on \((t,m)\)-families,'' by Joseph Y.- T. Leung and W.-D. Wei (Q1906133) (← links)
- The partial gossiping problem (Q1910536) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Quasi-threshold graphs (Q1923584) (← links)
- Parity and strong parity edge-colorings of graphs (Q1928503) (← links)
- On the mixed domination problem in graphs (Q1945934) (← links)
- \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110) (← links)
- A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (Q1950396) (← links)
- Pseudo-Hamiltonian-connected graphs (Q1971217) (← links)
- Circular chromatic numbers of distance graphs with distance sets missing multiples (Q1971805) (← links)
- The 4-choosability of planar graphs and cycle adjacency (Q1981715) (← links)
- A short derivation for Turán numbers of paths (Q1990361) (← links)
- Graphs with small balanced decomposition numbers (Q2251145) (← links)
- From edge-coloring to strong edge-coloring (Q2341055) (← links)
- On fully orientability of 2-degenerate graphs (Q2380068) (← links)
- Node-disjoint paths in hierarchical hypercube networks (Q2384539) (← links)
- Counterexamples to an edge spread question for zero forcing number (Q2442364) (← links)
- \(b\)-chromatic numbers of powers of paths and cycles (Q2444545) (← links)
- Rainbow domination and related problems on strongly chordal graphs (Q2446318) (← links)
- Algorithmic aspects of the \(k\)-domination problem in graphs (Q2446334) (← links)
- The linear guessing number of undirected graphs (Q2447965) (← links)
- Adaptive group testing for consecutive positives (Q2469989) (← links)
- Distance graphs on \(\mathbb R^n\) with 1-norm (Q2471053) (← links)
- Profile minimization on compositions of graphs (Q2471064) (← links)
- Group testing in graphs (Q2471072) (← links)
- Clique coverings and partitions of line graphs (Q2483388) (← links)
- Profile minimization on products of graphs (Q2495515) (← links)
- Isometric path numbers of graphs (Q2501546) (← links)
- Power domination in graphs (Q2502911) (← links)
- Strong edge-coloring for jellyfish graphs (Q2515576) (← links)
- A finiteness theorem for maximal independent sets (Q2563420) (← links)
- Dot product dimensions of graphs (Q2636805) (← links)
- Reliabilities of consecutive-\(k\) systems (Q2703797) (← links)
- Minimum span of no-hole \((r+1)\)-distant colorings (Q2753531) (← links)
- Roman domination on 2-connected graphs (Q2902897) (← links)
- (Q3037444) (← links)
- The degree-preserving spanning tree problem in strongly chordal and directed path graphs (Q3057180) (← links)
- Consecutive Edge-Colorings of Generalized θ-Graphs (Q3098089) (← links)
- Near-automorphisms of paths (Q3106268) (← links)
- (Q3114991) (← links)
- (Q3115034) (← links)
- Covering, Packing and Generalized Perfection (Q3220635) (← links)
- Optimal Consecutive-<i>k</i>−Out−of−<i>n</i> Systems under a Fixed Budget (Q3415871) (← links)
- (Q3439683) (← links)
- The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs (Q3697054) (← links)
- (Q3749069) (← links)
- (Q3778772) (← links)
- (Q3808243) (← links)
