Gerard J. Chang

Orcid: 0000-0002-4259-7410

Affiliations:
  • National Chiao Tung University, Taiwan


According to our database1, Gerard J. Chang authored at least 161 papers between 1980 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Edge-removing games on graphs.
Discret. Appl. Math., 2024

2021
The 4-choosability of planar graphs and cycle adjacency.
Discret. Math., 2021

2018
On the precise value of the strong chromatic index of a planar graph with a large girth.
Discret. Appl. Math., 2018

2017
Total Weight Choosability of Trees.
SIAM J. Discret. Math., 2017

2016
Max-Coloring of Vertex-Weighted Graphs.
Graphs Comb., 2016

Edge Roman Domination on Graphs.
Graphs Comb., 2016

2015
On the <i>k</i>-power domination of hypergraphs.
J. Comb. Optim., 2015

Strong edge-coloring for jellyfish graphs.
Discret. Math., 2015

The number of steps and the final configuration of relaxation procedures on graphs.
Discret. Appl. Math., 2015

From Edge-Coloring to Strong Edge-Coloring.
Electron. J. Comb., 2015

2014
Graphs with small balanced decomposition numbers.
J. Comb. Optim., 2014

Bandwidth sums of block graphs and cacti.
J. Comb. Optim., 2014

Strong chromatic index of planar graphs with large girth.
Discuss. Math. Graph Theory, 2014

Dot product dimensions of graphs.
Discret. Appl. Math., 2014

On the algorithmic complexity of k-tuple total domination.
Discret. Appl. Math., 2014

2013
On the mixed domination problem in graphs.
Theor. Comput. Sci., 2013

Strong Chromatic Index of 2-Degenerate Graphs.
J. Graph Theory, 2013

A short proof for Chen's Alternative Kneser Coloring Lemma.
J. Comb. Theory A, 2013

Roman domination on strongly chordal graphs.
J. Comb. Optim., 2013

Algorithmic aspect of stratified domination in graphs.
Inf. Process. Lett., 2013

On a conjecture on the balanced decomposition number.
Discret. Math., 2013

<i>b</i>b-chromatic numbers of powers of paths and cycles.
Discret. Appl. Math., 2013

b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture.
Discret. Appl. Math., 2013

Algorithmic aspects of the <i>k</i>k-domination problem in graphs.
Discret. Appl. Math., 2013

Rainbow domination and related problems on strongly chordal graphs.
Discret. Appl. Math., 2013

A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs.
Algorithmica, 2013

2012
Complexity of distance paired-domination problem in graphs.
Theor. Comput. Sci., 2012

Roman Domination on 2-Connected Graphs.
SIAM J. Discret. Math., 2012

The competition number of a graph with exactly two holes.
J. Comb. Optim., 2012

Parity and strong parity edge-colorings of graphs.
J. Comb. Optim., 2012

Hamiltonian numbers of Möbius double loop networks.
J. Comb. Optim., 2012

Upper k-tuple domination in graphs.
Discret. Math. Theor. Comput. Sci., 2012

Upper bounds on Roman domination numbers of graphs.
Discret. Math., 2012

(Δ+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles.
Discret. Math., 2012

Strong edge-coloring for cubic Halin graphs.
Discret. Math., 2012

First-fit chromatic numbers of d-degenerate graphs.
Discret. Math., 2012

Equitable colorings of Cartesian products of graphs.
Discret. Appl. Math., 2012

Competition numbers of complete r-partite graphs.
Discret. Appl. Math., 2012

Balanced k-decompositions of graphs.
Discret. Appl. Math., 2012

Generalized power domination of graphs.
Discret. Appl. Math., 2012

2011
Near-automorphisms of paths.
J. Graph Theory, 2011

Resource-sharing systems and hypergraph colorings.
J. Comb. Optim., 2011

Local condition for planar graphs of maximum degree 7 to be 8-totally colorable.
Discret. Appl. Math., 2011

On the Number of Subsequences with a Given Sum in a Finite Abelian Group.
Electron. J. Comb., 2011

2010
The degree-preserving spanning tree problem in strongly chordal and directed path graphs.
Networks, 2010

On the total choosability of planar graphs and of sparse graphs.
Inf. Process. Lett., 2010

Equitable colorings of Kronecker products of graphs.
Discret. Appl. Math., 2010

Rainbow domination on trees.
Discret. Appl. Math., 2010

Multicompetition numbers of some multigraphs.
Ars Comb., 2010

On competition polysemy and m-competition polysemy.
Ars Comb., 2010

Consecutive Edge-Colorings of Generalized θ-Graphs.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009
A note on equitable colorings of forests.
Eur. J. Comb., 2009

L(h, k)-labelings of Hamming graphs.
Discret. Math., 2009

Independent arcs of acyclic orientations of complete r-partite graphs.
Discret. Math., 2009

Note on the m-step competition numbers of paths and cycles.
Discret. Appl. Math., 2009

The competition number of a graph with exactly h holes, all of which are independent.
Discret. Appl. Math., 2009

Distance-two labellings of Hamming graphs.
Discret. Appl. Math., 2009

2008
Finding cycles in hierarchical hypercube networks.
Inf. Process. Lett., 2008

On fully orientability of 2-degenerate graphs.
Inf. Process. Lett., 2008

The upper bound on k-tuple domination numbers of graphs.
Eur. J. Comb., 2008

Clique coverings and partitions of line graphs.
Discret. Math., 2008

Adaptive group testing for consecutive positives.
Discret. Math., 2008

2007
Induced-path partition on graphs with special blocks.
Theor. Comput. Sci., 2007

On the (n, t)-antipodal Gray codes.
Theor. Comput. Sci., 2007

(t, k) - Diagnosis for Matching Composition Networks under the MM* Model.
IEEE Trans. Computers, 2007

Profile minimization on compositions of graphs.
J. Comb. Optim., 2007

Group testing in graphs.
J. Comb. Optim., 2007

Distance graphs on R <sup> <i>n</i> </sup> with 1-norm.
J. Comb. Optim., 2007

Editorial note.
J. Comb. Optim., 2007

Node-disjoint paths in hierarchical hypercube networks.
Inf. Sci., 2007

Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs.
Discret. Math., 2007

No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups.
Discret. Math., 2007

Distance-two labelings of digraphs.
Discret. Appl. Math., 2007

Bipancyclicity of Hierarchical Hypercube Networks.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2007

2006
(t, k)-Diagnosis for Matching Composition Networks.
IEEE Trans. Computers, 2006

Power domination in graphs.
Discret. Math., 2006

Profile minimization on products of graphs.
Discret. Math., 2006

Isometric path numbers of graphs.
Discret. Math., 2006

Node-disjoint paths in hierarchical hypercube networks.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005
Diagnosabilities of Regular Networks.
IEEE Trans. Parallel Distributed Syst., 2005

Isometric-path numbers of block graphs.
Inf. Process. Lett., 2005

Probe interval bigraphs.
Electron. Notes Discret. Math., 2005

Path partition for graphs with special blocks.
Discret. Appl. Math., 2005

The PIGs Full Monty - A Floor Show of Minimal Separators.
Proceedings of the STACS 2005, 2005

2004
Vertex and Tree Arboricities of Graphs.
J. Comb. Optim., 2004

On the profile of the corona of two graphs.
Inf. Process. Lett., 2004

Geodetic spectra of graphs.
Eur. J. Comb., 2004

Interval numbers of powers of block graph.
Discret. Math., 2004

The weighted independent domination problem is NP-complete for chordal graphs.
Discret. Appl. Math., 2004

Locally connected spanning trees on graphs
CoRR, 2004

2003
k-tuple domination in graphs.
Inf. Process. Lett., 2003

Distance-two labelings of graphs.
Eur. J. Comb., 2003

Centers and medians of distance-hereditary graphs.
Discret. Math., 2003

The L(2, 1)-labeling problem on ditrees.
Ars Comb., 2003

2002
Corrigendum to "The path-partition problem in block graphs".
Inf. Process. Lett., 2002

A note on the Gallai-Roy-Vitaver Theorem.
Discret. Math., 2002

Total interval numbers of complete r-partite graphs.
Discret. Appl. Math., 2002

Domination in distance-hereditary graphs.
Discret. Appl. Math., 2002

k-Subdomination in graphs.
Discret. Appl. Math., 2002

Algorithmic aspects of counting independent sets.
Ars Comb., 2002

2001
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs.
Theor. Comput. Sci., 2001

Channel graphs of bit permutation networks.
Theor. Comput. Sci., 2001

Preface.
Theor. Comput. Sci., 2001

Minimum Span of No-Hole (r+1)-Distant Colorings.
SIAM J. Discret. Math., 2001

Families of Graphs Closed Under Taking Powers.
Graphs Comb., 2001

The K<sub>r</sub>-Packing Problem.
Computing, 2001

No-hole 2-distant colorings for unit interval graphs.
Ars Comb., 2001

2000
Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples.
Eur. J. Comb., 2000

On <i>L</i>(<i>d</i>, 1)-labelings of graphs.
Discret. Math., 2000

Pseudo-Hamiltonian-connected graphs.
Discret. Appl. Math., 2000

Linear k-arboricities on trees.
Discret. Appl. Math., 2000

1999
Characterizing bit permutation networks.
Networks, 1999

On <i>k</i>-ary spanning trees of tournaments.
J. Graph Theory, 1999

The circular chromatic number of the Mycielskian of <i>G</i>.
J. Graph Theory, 1999

The consecutive-4 digraphs are Hamiltonian.
J. Graph Theory, 1999

Distance Graphs and T-Coloring.
J. Comb. Theory B, 1999

T-Colorings and T-Edge Spans of Graphs.
Graphs Comb., 1999

Rabin numbers of Butterfly networks.
Discret. Math., 1999

The number of maximal independent sets in connected triangle-free graphs.
Discret. Math., 1999

Circular chromatic numbers of Mycielski's graphs.
Discret. Math., 1999

Characterizations of bipartite Steinhaus graphs.
Discret. Math., 1999

Integral Sum Numbers of Graphs.
Ars Comb., 1999

1998
k-Neighborhood-Covering and -Independence Problems for Chordal Graphs.
SIAM J. Discret. Math., 1998

Generalized Diameters and Rabin Numbers of Networks.
J. Comb. Optim., 1998

Localizing Combinatorial Properties for Partitions on Block Graphs.
J. Comb. Optim., 1998

Sortabilities of Partition Properties.
J. Comb. Optim., 1998

Enumerating Consecutive and Nested Partitions for Graphs.
Eur. J. Comb., 1998

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs.
Eur. J. Comb., 1998

Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs.
Discret. Appl. Math., 1998

The Vertex-Disjoint Triangles Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997
Optimality of consecutive and nested tree partitions.
Networks, 1997

Signed degree sequences of signed graphs.
J. Graph Theory, 1997

The exact gossiping problem.
Discret. Math., 1997

Cordial labeling of mK<sub>n</sub>.
Discret. Math., 1997

Proper interval graphs and the guard problem.
Discret. Math., 1997

k-Path Partitions in Trees.
Discret. Appl. Math., 1997

Maximal Independent Sets in Graphs with at Most One Cycle.
Discret. Appl. Math., 1997

The ß-assignment problem in general graphs.
Comput. Oper. Res., 1997

1996
The L(2, 1)-Labeling Problem on Graphs.
SIAM J. Discret. Math., 1996

A finiteness theorem for maximal independent sets.
Graphs Comb., 1996

The partial gossiping problem.
Discret. Math., 1996

Quasi-threshold Graphs.
Discret. Appl. Math., 1996

Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs.
Discret. Appl. Math., 1996

1995
The edge domination problem.
Discuss. Math. Graph Theory, 1995

Weighted Independent Perfect Domination on Cocomparability Graphs.
Discret. Appl. Math., 1995

1994
The Profile Minimization Problem in Trees.
SIAM J. Comput., 1994

The <i>w</i>-median of a connected strongly chordal graph.
J. Graph Theory, 1994

The Path-Partition Problem in Block Graphs.
Inf. Process. Lett., 1994

Edge domatic numbers of complete n- partite graphs.
Graphs Comb., 1994

The domatic number problem.
Discret. Math., 1994

1993
Algorithmic Aspects of Neighborhood Numbers.
SIAM J. Discret. Math., 1993

1992
Set to Set Broadcasting in Communication Networks.
Discret. Appl. Math., 1992

1991
Centers of chordal graphs.
Graphs Comb., 1991

1990
The Domatic Number Problem in Interval Graphs.
SIAM J. Discret. Math., 1990

An upper bound for the transversal numbers of 4-uniform hypergraphs.
J. Comb. Theory B, 1990

1989
On the Number of SDR of a (t, n)-family.
Eur. J. Comb., 1989

1988
Labeling algorithms for domination problems in sun-free chordal graphs.
Discret. Appl. Math., 1988

1985
Diagonal and Pandiagonal Tournament Latin Squares.
Eur. J. Comb., 1985

1982
R-domination on block graphs.
Oper. Res. Lett., 1982

Group testing with two defectives.
Discret. Appl. Math., 1982

1980
A Group Testing Problem.
SIAM J. Algebraic Discret. Methods, 1980


  Loading...