The following pages link to Gerard Jennhwa Chang (Q400523):
Displaying 50 items.
- (Q168198) (redirect page) (← links)
- (Q1164362) (redirect page) (← links)
- Edge Roman domination on graphs (Q343714) (← links)
- Roman domination on strongly chordal graphs (Q385486) (← links)
- On a conjecture on the balanced decomposition number (Q389207) (← links)
- On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
- On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
- Strong edge-coloring for cubic Halin graphs (Q408187) (← links)
- Resource-sharing systems and hypergraph colorings (Q411210) (← links)
- A characterization of graphs with rank 5 (Q414705) (← links)
- First-fit chromatic numbers of \(d\)-degenerate graphs (Q427876) (← links)
- Balanced \(k\)-decompositions of graphs (Q427910) (← links)
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709) (← links)
- The competition number of a graph with exactly two holes (Q434196) (← links)
- Hamiltonian numbers of Möbius double loop networks (Q437052) (← links)
- Generalized power domination of graphs (Q444434) (← links)
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- The number of steps and the final configuration of relaxation procedures on graphs (Q479017) (← links)
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable (Q534337) (← links)
- Equitable colorings of Kronecker products of graphs (Q602760) (← links)
- A characterization of graphs with rank 4 (Q630525) (← links)
- Vertex-coloring edge-weightings of graphs (Q647275) (← links)
- The \(L(2,1)\)-\({\mathcal F}\)-labeling problem of graphs (Q652112) (← links)
- Competition numbers of complete \(r\)-partite graphs (Q713323) (← links)
- Upper bounds on Roman domination numbers of graphs (Q764908) (← links)
- Equitable colorings of Cartesian products of graphs (Q765364) (← links)
- The k-neighbor domination problem (Q811346) (← links)
- Isometric-path numbers of block graphs (Q835002) (← links)
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
- Induced-path partition on graphs with special blocks (Q868947) (← links)
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397) (← links)
- On the \({k}\)-power domination of hypergraphs (Q887853) (← links)
- The upper bound on \(k\)-tuple domination numbers of graphs (Q925036) (← links)
- On the rank of a cograph (Q929485) (← links)
- On minimum rank and zero forcing sets of a graph (Q967512) (← links)
- Rainbow domination on trees (Q968106) (← links)
- Finding cycles in hierarchical hypercube networks (Q975541) (← links)
- A note on universally optimal matrices and field independence of the minimum rank of a graph (Q977476) (← links)
- \(k\)-tuple domination in graphs (Q1014390) (← links)
- On the \((n,t)\)-antipodal Gray codes (Q1022591) (← links)
- A note on equitable colorings of forests (Q1024272) (← links)
- \(L(h,k)\)-labelings of Hamming graphs (Q1025475) (← links)
- Distance-two labellings of Hamming graphs (Q1026152) (← links)
- Note on the \(m\)-step competition numbers of paths and cycles (Q1026165) (← links)
- The competition number of a graph with exactly \(h\) holes, all of which are independent (Q1028099) (← links)
- On the profile of the corona of two graphs (Q1029099) (← links)
- Independent arcs of acyclic orientations of complete \(r\)-partite graphs (Q1043945) (← links)
- The poset scheduling problem (Q1062616) (← links)
- Diagonal and pandiagonal tournament Latin squares (Q1063607) (← links)
- The minimum of the antichains in the factor poset (Q1101454) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
