Gerard Jennhwa Chang

From MaRDI portal
Person:400523

Available identifiers

zbMath Open chang.gerard-jennhwaMaRDI QIDQ400523

List of research outcomes





PublicationDate of PublicationType
Weighted connected domination and Steiner trees in distance-hereditary graphs (extended abstract)2024-07-05Paper
Edge-removing games on graphs2024-04-02Paper
The 4-choosability of planar graphs and cycle adjacency2021-09-06Paper
A short derivation for Turán numbers of paths2018-10-25Paper
On the precise value of the strong chromatic index of a planar graph with a large girth2018-09-06Paper
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model2018-06-12Paper
Total Weight Choosability of Trees2017-05-24Paper
Edge Roman domination on graphs2016-11-29Paper
Max-coloring of vertex-weighted graphs2016-03-02Paper
On the \({k}\)-power domination of hypergraphs2015-11-03Paper
Strong edge-coloring for jellyfish graphs2015-08-05Paper
From edge-coloring to strong edge-coloring2015-04-22Paper
The number of steps and the final configuration of relaxation procedures on graphs2014-12-05Paper
Strong chromatic index of planar graphs with large girth2014-11-18Paper
On the algorithmic complexity of \(k\)-tuple total domination2014-08-22Paper
Graphs with small balanced decomposition numbers2014-07-11Paper
The linear guessing number of undirected graphs2014-04-29Paper
Rainbow domination and related problems on strongly chordal graphs2014-04-16Paper
Algorithmic aspects of the \(k\)-domination problem in graphs2014-04-16Paper
\(b\)-chromatic numbers of powers of paths and cycles2014-04-10Paper
Counterexamples to an edge spread question for zero forcing number2014-04-03Paper
https://portal.mardi4nfdi.de/entity/Q54030412014-03-25Paper
Dot product dimensions of graphs2014-02-18Paper
On a conjecture on the balanced decomposition number2014-01-20Paper
Roman domination on strongly chordal graphs2013-12-02Paper
Strong Chromatic Index of 2-Degenerate Graphs2013-05-21Paper
A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs2013-05-13Paper
\(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture2013-04-25Paper
On the mixed domination problem in graphs2013-04-17Paper
Parity and strong parity edge-colorings of graphs2013-01-03Paper
A short proof for Chen's alternative Kneser coloring lemma2012-11-09Paper
Competition numbers of complete \(r\)-partite graphs2012-10-26Paper
Roman domination on 2-connected graphs2012-08-22Paper
Generalized power domination of graphs2012-08-14Paper
Hamiltonian numbers of Möbius double loop networks2012-07-17Paper
The competition number of a graph with exactly two holes2012-07-10Paper
(\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles2012-07-04Paper
First-fit chromatic numbers of \(d\)-degenerate graphs2012-06-18Paper
Balanced \(k\)-decompositions of graphs2012-06-18Paper
A characterization of graphs with rank 52012-05-11Paper
Resource-sharing systems and hypergraph colorings2012-04-04Paper
Strong edge-coloring for cubic Halin graphs2012-03-29Paper
On the total choosability of planar graphs and of sparse graphs2012-03-27Paper
Equitable colorings of Cartesian products of graphs2012-03-19Paper
Upper bounds on Roman domination numbers of graphs2012-03-16Paper
https://portal.mardi4nfdi.de/entity/Q31149912012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31150342012-02-20Paper
Near-automorphisms of paths2011-12-20Paper
The \(L(2,1)\)-\({\mathcal F}\)-labeling problem of graphs2011-12-19Paper
Vertex-coloring edge-weightings of graphs2011-12-01Paper
Consecutive Edge-Colorings of Generalized θ-Graphs2011-11-11Paper
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable2011-05-17Paper
A characterization of graphs with rank 42011-03-17Paper
The degree-preserving spanning tree problem in strongly chordal and directed path graphs2010-11-24Paper
Equitable colorings of Kronecker products of graphs2010-11-05Paper
A note on universally optimal matrices and field independence of the minimum rank of a graph2010-06-22Paper
Finding cycles in hierarchical hypercube networks2010-06-09Paper
Rainbow domination on trees2010-05-05Paper
On minimum rank and zero forcing sets of a graph2010-04-29Paper
On fully orientability of 2-degenerate graphs2010-03-24Paper
Independent arcs of acyclic orientations of complete \(r\)-partite graphs2009-12-10Paper
Isometric-path numbers of block graphs2009-08-27Paper
On the profile of the corona of two graphs2009-07-09Paper
The competition number of a graph with exactly \(h\) holes, all of which are independent2009-06-30Paper
Distance-two labellings of Hamming graphs2009-06-24Paper
Note on the \(m\)-step competition numbers of paths and cycles2009-06-24Paper
On the \((n,t)\)-antipodal Gray codes2009-06-22Paper
\(L(h,k)\)-labelings of Hamming graphs2009-06-19Paper
A note on equitable colorings of forests2009-06-17Paper
\(k\)-tuple domination in graphs2009-04-28Paper
On the rank of a cograph2008-06-17Paper
The upper bound on \(k\)-tuple domination numbers of graphs2008-05-29Paper
Clique coverings and partitions of line graphs2008-04-28Paper
A managed Bayesian risk approach for decision making alternatives2008-04-03Paper
Group testing in graphs2008-02-18Paper
Distance graphs on \(\mathbb R^n\) with 1-norm2008-02-18Paper
Profile minimization on compositions of graphs2008-02-18Paper
Adaptive group testing for consecutive positives2008-02-11Paper
Node-disjoint paths in hierarchical hypercube networks2007-10-10Paper
https://portal.mardi4nfdi.de/entity/Q34396832007-05-29Paper
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups2007-05-11Paper
Induced-path partition on graphs with special blocks2007-02-26Paper
Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs2007-02-13Paper
Optimal Consecutive-k−Out−of−n Systems under a Fixed Budget2007-01-19Paper
Isometric path numbers of graphs2006-09-14Paper
Power domination in graphs2006-09-13Paper
Profile minimization on products of graphs2006-06-30Paper
STACS 20052005-12-02Paper
https://portal.mardi4nfdi.de/entity/Q54660462005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q54615882005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54614682005-07-26Paper
Path partition for graphs with special blocks2005-02-23Paper
The weighted independent domination problem is NP-complete for chordal graphs2004-11-23Paper
Vertex and tree arboricities of graphs2004-11-22Paper
https://portal.mardi4nfdi.de/entity/Q47362262004-08-09Paper
Geodetic spectra of graphs.2004-03-14Paper
Interval numbers of powers of block graphs2004-02-02Paper
Centers and medians of distance-hereditary graphs2003-05-25Paper
Distance-two labelings of graphs2003-04-09Paper
Corrigendum to ``The path-partition problem in block graphs.2003-01-21Paper
A note on the Gallai-Roy-Vitaver theorem2002-12-02Paper
Group testing in bipartite graphs2002-12-02Paper
\(k\)-subdomination in graphs2002-08-29Paper
Total interval numbers of complete \(r\)-partite graphs2002-08-29Paper
Domination in distance-hereditary graphs2002-08-24Paper
Families of graphs closed under taking powers2002-05-13Paper
The \(K_r\)-packing problem2002-01-24Paper
Algorithmic aspect of \(k\)-tuple domination in graphs.2002-01-01Paper
Minimum span of no-hole \((r+1)\)-distant colorings2001-11-11Paper
The number of maximum independent sets in graphs2001-08-30Paper
Channel graphs of bit permutation networks2001-08-20Paper
Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs2001-08-20Paper
CORRIGENDA ON “NEW COMPARISONS IN BIRNBAUM IMPORTANCE FOR THE CONSECUTIVE-k-OUT-OF-n SYSTEM”2001-05-07Paper
Linear \(k\)-arboricities on trees2001-04-09Paper
https://portal.mardi4nfdi.de/entity/Q27037972001-03-15Paper
Localizing combinatorial properties for partitions on block graphs2001-03-04Paper
Sortabilities of partition properties2001-03-04Paper
The \(\beta\)-assignment problems2001-02-22Paper
https://portal.mardi4nfdi.de/entity/Q42620152000-11-26Paper
https://portal.mardi4nfdi.de/entity/Q45157362000-11-23Paper
Circular chromatic numbers of distance graphs with distance sets missing multiples2000-06-29Paper
Pseudo-Hamiltonian-connected graphs2000-06-29Paper
https://portal.mardi4nfdi.de/entity/Q44862582000-06-26Paper
The path-partition problem in block graphs2000-06-21Paper
Reliabilities for \((n,f,k)\) systems2000-06-07Paper
Bipartite Steinhaus graphs2000-05-18Paper
\(T\)-colorings and \(T\)-edge spans of graphs2000-05-18Paper
https://portal.mardi4nfdi.de/entity/Q49435262000-03-16Paper
Distance graphs and \(T\)-coloring2000-01-30Paper
The circular chromatic number of the Mycielskian ofGdk2000-01-02Paper
Wide diameters of butterfly networks1999-12-05Paper
Algorithmic aspects of linear \(k\)-arboricity1999-12-05Paper
Onk-ary spanning trees of tournaments1999-11-14Paper
Fault-tolerant routing in circulant networks and cycle prefix networks1999-11-11Paper
https://portal.mardi4nfdi.de/entity/Q42684311999-10-31Paper
https://portal.mardi4nfdi.de/entity/Q42327751999-08-17Paper
https://portal.mardi4nfdi.de/entity/Q42397641999-08-10Paper
Rabin numbers of Butterfly networks1999-08-09Paper
The number of maximal independent sets in connected triangle-free graphs1999-08-09Paper
Generalized diameters and Rabin numbers of networks1999-07-20Paper
https://portal.mardi4nfdi.de/entity/Q42427291999-05-11Paper
A unique arithmetic labeling of hexagonal lattices1999-03-09Paper
Weighted connected domination and Steiner trees in distance-hereditary graphs1999-02-01Paper
The path-partition problem in bipartite distance-hereditary graphs1999-01-03Paper
Circular chromatic numbers of Mycielski's graphs1999-01-01Paper
k-Neighborhood-Covering and -Independence Problems for Chordal Graphs1998-09-21Paper
Circular chromatic numbers and fractional chromatic numbers of distance graphs1998-09-16Paper
Enumerating consecutive and nested partitions for graphs1998-07-19Paper
The Hamiltonian property of the consecutive-3 digraphs1998-06-25Paper
\(k\)-path partitions in trees1998-06-11Paper
A simple and direct derivation for the number of noncrossing partitions1998-05-06Paper
https://portal.mardi4nfdi.de/entity/Q43852511998-04-13Paper
Algorithmic aspects of majority domination1998-03-02Paper
Maximal independent sets in graphs with at most one cycle1998-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42474631998-01-01Paper
Medians of graphs and kings of tournaments1997-12-07Paper
Integral distance graphs1997-12-07Paper
Optimality of consecutive and nested tree partitions1997-10-26Paper
The \(\beta\)-assignment problem in general graphs1997-10-26Paper
The exact gossiping problem1997-10-09Paper
Proper interval graphs and the guard problem1997-08-10Paper
Quasi-threshold graphs1997-02-26Paper
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs1997-01-13Paper
A finiteness theorem for maximal independent sets1996-12-12Paper
Weighted independent perfect domination on cocomparability graphs1996-08-05Paper
The partial gossiping problem1996-03-24Paper
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. Wei1996-02-26Paper
The edge domination problem1995-11-27Paper
https://portal.mardi4nfdi.de/entity/Q43091481995-01-09Paper
Edge domatic numbers of complete \(n\)-partite graphs1994-12-11Paper
The domatic number problem1994-11-24Paper
The w‐median of a connected strongly chordal graph1994-11-06Paper
Algorithmic Aspects of Neighborhood Numbers1993-06-29Paper
Set to set broadcasting in communication networks1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40204641993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39880821992-06-28Paper
Centers of chordal graphs1992-06-27Paper
An upper bound for the transversal numbers of 4-uniform hypergraphs1992-06-25Paper
The k-neighbor domination problem1991-01-01Paper
The Domatic Number Problem in Interval Graphs1990-01-01Paper
Total domination in block graphs1989-01-01Paper
On the number of SDR of a (t,n)-family1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38354651988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38183271988-01-01Paper
Labeling algorithms for domination problems in sun-free chordal graphs1988-01-01Paper
The minimum of the antichains in the factor poset1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38082431987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37490691986-01-01Paper
Diagonal and pandiagonal tournament Latin squares1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37787721985-01-01Paper
Covering, Packing and Generalized Perfection1985-01-01Paper
The poset scheduling problem1985-01-01Paper
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30374441983-01-01Paper
R-domination of block graphs1982-01-01Paper
Group testing with two defectives1982-01-01Paper
A Group Testing Problem on Two Disjoint Sets1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39608851981-01-01Paper
A Group Testing Problem1980-01-01Paper
Complete Diagonals of Latin Squares1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41825731977-01-01Paper

Research outcomes over time

This page was built for person: Gerard Jennhwa Chang