Gerard J. Chang

Lecture Notes Series on Computing 17, WorldScientific, ISBN: 9789819817306, 2026

2024

Edge-removing games on graphs.

[BibT_eX]

[DOI]

Alianna Singyue Yu

Discret. Appl. Math., 2024

2021

The 4-choosability of planar graphs and cycle adjacency.

[BibT_eX]

[DOI]

Juei-Yin Lin

Chung-Ying Yang

Discret. Math., 2021

2018

On the precise value of the strong chromatic index of a planar graph with a large girth.

[BibT_eX]

[DOI]

Guan-Huei Duh

Discret. Appl. Math., 2018

2017

Total Weight Choosability of Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

2016

Max-Coloring of Vertex-Weighted Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Edge Roman Domination on Graphs.

[BibT_eX]

[DOI]

Sheng-Hua Chen

Graphs Comb., 2016

2015

On the k-power domination of hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Strong edge-coloring for jellyfish graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

The number of steps and the final configuration of relaxation procedures on graphs.

[BibT_eX]

[DOI]

Sheng-Hua Chen

Discret. Appl. Math., 2015

From Edge-Coloring to Strong Edge-Coloring.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

Graphs with small balanced decomposition numbers.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Bandwidth sums of block graphs and cacti.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Strong chromatic index of planar graphs with large girth.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

Dot product dimensions of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

On the algorithmic complexity of k-tuple total domination.

[BibT_eX]

[DOI]

James K. Lan

Discret. Appl. Math., 2014

2013

On the mixed domination problem in graphs.

[BibT_eX]

[DOI]

James K. Lan

Theor. Comput. Sci., 2013

Strong Chromatic Index of 2-Degenerate Graphs.

[BibT_eX]

[DOI]

N. Narayanan

J. Graph Theory, 2013

A short proof for Chen's Alternative Kneser Coloring Lemma.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

Roman domination on strongly chordal graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

Algorithmic aspect of stratified domination in graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

On a conjecture on the balanced decomposition number.

[BibT_eX]

[DOI]

N. Narayanan

Discret. Math., 2013

bb-chromatic numbers of powers of paths and cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Algorithmic aspects of the kk-domination problem in graphs.

[BibT_eX]

[DOI]

James K. Lan

Discret. Appl. Math., 2013

Rainbow domination and related problems on strongly chordal graphs.

[BibT_eX]

[DOI]

Jiaojiao Wu

Discret. Appl. Math., 2013

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

[BibT_eX]

[DOI]

Algorithmica, 2013

2012

Complexity of distance paired-domination problem in graphs.

[BibT_eX]

[DOI]

B. S. Panda

Dinabandhu Pradhan

Theor. Comput. Sci., 2012

Roman Domination on 2-Connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

The competition number of a graph with exactly two holes.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Parity and strong parity edge-colorings of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Hamiltonian numbers of Möbius double loop networks.

[BibT_eX]

[DOI]

Ting-Pang Chang

J. Comb. Optim., 2012

Upper k-tuple domination in graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2012

Upper bounds on Roman domination numbers of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

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

[BibT_eX]

[DOI]

Discret. Math., 2012

Strong edge-coloring for cubic Halin graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

First-fit chromatic numbers of d-degenerate graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Equitable colorings of Cartesian products of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Competition numbers of complete r-partite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Balanced k-decompositions of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Generalized power domination of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Near-automorphisms of paths.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Resource-sharing systems and hypergraph colorings.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

Local condition for planar graphs of maximum degree 7 to be 8-totally colorable.

[BibT_eX]

[DOI]

Jianfeng Hou

Discret. Appl. Math., 2011

On the Number of Subsequences with a Given Sum in a Finite Abelian Group.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

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

[BibT_eX]

[DOI]

Networks, 2010

On the total choosability of planar graphs and of sparse graphs.

[BibT_eX]

[DOI]

Jianfeng Hou

Inf. Process. Lett., 2010

Equitable colorings of Kronecker products of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Rainbow domination on trees.

[BibT_eX]

[DOI]

Jiaojiao Wu

Discret. Appl. Math., 2010

Multicompetition numbers of some multigraphs.

[BibT_eX]

Ars Comb., 2010

On competition polysemy and m-competition polysemy.

[BibT_eX]

Ars Comb., 2010

Consecutive Edge-Colorings of Generalized θ-Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009

A note on equitable colorings of forests.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

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

[BibT_eX]

[DOI]

Lian-Hwao Huang

Discret. Math., 2009

Independent arcs of acyclic orientations of complete r-partite graphs.

[BibT_eX]

[DOI]

Chen-Ying Lin

Discret. Math., 2009

Note on the m-step competition numbers of paths and cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Distance-two labellings of Hamming graphs.

[BibT_eX]

[DOI]

Changhong Lu

Sanming Zhou

Discret. Appl. Math., 2009

2008

Finding cycles in hierarchical hypercube networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

On fully orientability of 2-degenerate graphs.

[BibT_eX]

[DOI]

Hsin-Hao Lai

Ko-Wei Lih

Inf. Process. Lett., 2008

The upper bound on k-tuple domination numbers of graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Clique coverings and partitions of line graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

Adaptive group testing for consecutive positives.

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

Induced-path partition on graphs with special blocks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On the (n, t)-antipodal Gray codes.

[BibT_eX]

[DOI]

Sen-Peng Eu

Chung-Heng Yeh

Theor. Comput. Sci., 2007

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

[BibT_eX]

[DOI]

Guey-Yun Chang

IEEE Trans. Computers, 2007

Profile minimization on compositions of graphs.

[BibT_eX]

[DOI]

Yu-Ping Tsao

J. Comb. Optim., 2007

Group testing in graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Distance graphs on R n with 1-norm.

[BibT_eX]

[DOI]

Jer-Jeong Chen

J. Comb. Optim., 2007

Editorial note.

[BibT_eX]

[DOI]

Hung-Lin Fu

J. Comb. Optim., 2007

Node-disjoint paths in hierarchical hypercube networks.

[BibT_eX]

[DOI]

Inf. Sci., 2007

Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups.

[BibT_eX]

[DOI]

Changhong Lu

Sanming Zhou

Discret. Math., 2007

Distance-two labelings of digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Bipancyclicity of Hierarchical Hypercube Networks.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2007

2006

(t, k)-Diagnosis for Matching Composition Networks.

[BibT_eX]

[DOI]

Guey-Yun Chang

IEEE Trans. Computers, 2006

Power domination in graphs.

[BibT_eX]

[DOI]

Min Zhao

Liying Kang

Discret. Math., 2006

Profile minimization on products of graphs.

[BibT_eX]

[DOI]

Yu-Ping Tsao

Discret. Math., 2006

Isometric path numbers of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

Node-disjoint paths in hierarchical hypercube networks.

[BibT_eX]

[DOI]

Ruei-Yu Wu

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005

Diagnosabilities of Regular Networks.

[BibT_eX]

[DOI]

Guey-Yun Chang

IEEE Trans. Parallel Distributed Syst., 2005

Isometric-path numbers of block graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Probe interval bigraphs.

[BibT_eX]

[DOI]

Ton Kloks

Sheng-Lung Peng

Electron. Notes Discret. Math., 2005

Path partition for graphs with special blocks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

The PIGs Full Monty - A Floor Show of Minimal Separators.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

2004

Vertex and Tree Arboricities of Graphs.

[BibT_eX]

[DOI]

Chiuyuan Chen

Yaping Chen

J. Comb. Optim., 2004

On the profile of the corona of two graphs.

[BibT_eX]

[DOI]

Yung-Ling Lai

Inf. Process. Lett., 2004

Geodetic spectra of graphs.

[BibT_eX]

[DOI]

Hong-Tsu Wang

Eur. J. Comb., 2004

Interval numbers of powers of block graph.

[BibT_eX]

[DOI]

Mingjang Chen

Douglas B. West

Discret. Math., 2004

The weighted independent domination problem is NP-complete for chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Locally connected spanning trees on graphs

[BibT_eX]

[DOI]

CoRR, 2004

2003

k-tuple domination in graphs.

[BibT_eX]

[DOI]

Chung-Shou Liao

Inf. Process. Lett., 2003

Distance-two labelings of graphs.

[BibT_eX]

[DOI]

Changhong Lu

Eur. J. Comb., 2003

Centers and medians of distance-hereditary graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

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

[BibT_eX]

Ars Comb., 2003

2002

Corrigendum to "The path-partition problem in block graphs".

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

A note on the Gallai-Roy-Vitaver Theorem.

[BibT_eX]

[DOI]

Discret. Math., 2002

Total interval numbers of complete r-partite graphs.

[BibT_eX]

[DOI]

Mingjang Chen

Discret. Appl. Math., 2002

Domination in distance-hereditary graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

k-Subdomination in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Algorithmic aspects of counting independent sets.

[BibT_eX]

Min-Jen Jou

Ars Comb., 2002

2001

Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Channel graphs of bit permutation networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Minimum Span of No-Hole (r+1)-Distant Colorings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

Families of Graphs Closed Under Taking Powers.

[BibT_eX]

[DOI]

Mingjang Chen

Graphs Comb., 2001

The Kr-Packing Problem.

[BibT_eX]

[DOI]

Computing, 2001

No-hole 2-distant colorings for unit interval graphs.

[BibT_eX]

Ars Comb., 2001

2000

Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples.

[BibT_eX]

[DOI]

Eur. J. Comb., 2000

On L(d, 1)-labelings of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

Pseudo-Hamiltonian-connected graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

Linear k-arboricities on trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1999

On k-ary spanning trees of tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

The circular chromatic number of the Mycielskian of G.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

The consecutive-4 digraphs are Hamiltonian.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Distance Graphs and T-Coloring.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

T-Colorings and T-Edge Spans of Graphs.

[BibT_eX]

[DOI]

Shin-Jie Hu

Graphs Comb., 1999

Rabin numbers of Butterfly networks.

[BibT_eX]

[DOI]

Discret. Math., 1999

The number of maximal independent sets in connected triangle-free graphs.

[BibT_eX]

[DOI]

Min-Jen Jou

Discret. Math., 1999

Circular chromatic numbers of Mycielski's graphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

Characterizations of bipartite Steinhaus graphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

Integral Sum Numbers of Graphs.

[BibT_eX]

Ars Comb., 1999

1998

k-Neighborhood-Covering and -Independence Problems for Chordal Graphs.

[BibT_eX]

[DOI]

Shiow-Fen Hwang

SIAM J. Discret. Math., 1998

Generalized Diameters and Rabin Numbers of Networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 1998

Localizing Combinatorial Properties for Partitions on Block Graphs.

[BibT_eX]

[DOI]

Yi-Ching Yao

J. Comb. Optim., 1998

Sortabilities of Partition Properties.

[BibT_eX]

[DOI]

J. Comb. Optim., 1998

Enumerating Consecutive and Nested Partitions for Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1998

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1998

The Vertex-Disjoint Triangles Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997

Optimality of consecutive and nested tree partitions.

[BibT_eX]

[DOI]

Networks, 1997

Signed degree sequences of signed graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1997

The exact gossiping problem.

[BibT_eX]

[DOI]

Yuh-Jiuan Tsay

Discret. Math., 1997

Cordial labeling of mKn.

[BibT_eX]

[DOI]

Y. H. Harris Kwong

Discret. Math., 1997

Proper interval graphs and the guard problem.

[BibT_eX]

[DOI]

Chiuyuan Chen

Chin-Chen Chang

Discret. Math., 1997

k-Path Partitions in Trees.

[BibT_eX]

[DOI]

Jing-Ho Yan

Sandra Mitchell Hedetniemi

Stephen T. Hedetniemi

Discret. Appl. Math., 1997

Maximal Independent Sets in Graphs with at Most One Cycle.

[BibT_eX]

[DOI]

Min-Jen Jou

Discret. Appl. Math., 1997

The ß-assignment problem in general graphs.

[BibT_eX]

[DOI]

Pei-Hsin Ho

Comput. Oper. Res., 1997

Characterizing bit permutation networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Switching Networks, 1997

1996

The L(2, 1)-Labeling Problem on Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1996

A finiteness theorem for maximal independent sets.

[BibT_eX]

[DOI]

Graphs Comb., 1996

The partial gossiping problem.

[BibT_eX]

[DOI]

Yuh-Jiuan Tsay

Discret. Math., 1996

Quasi-threshold Graphs.

[BibT_eX]

[DOI]

Jing-Ho Yan

Jer-Jeong Chen

Discret. Appl. Math., 1996

Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

1995

The edge domination problem.

[BibT_eX]

[DOI]

Shiow-Fen Hwang

Discuss. Math. Graph Theory, 1995

Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics and Computer Science, 1995

1994

The Profile Minimization Problem in Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

The w-median of a connected strongly chordal graph.

[BibT_eX]

[DOI]

Hai-Yen Lee

J. Graph Theory, 1994

The Path-Partition Problem in Block Graphs.

[BibT_eX]

[DOI]

Jing-Ho Yan

Inf. Process. Lett., 1994

Edge domatic numbers of complete n- partite graphs.

[BibT_eX]

[DOI]

Shiow-Fen Hwang

Graphs Comb., 1994

The domatic number problem.

[BibT_eX]

[DOI]

Discret. Math., 1994

1993

Algorithmic Aspects of Neighborhood Numbers.

[BibT_eX]

[DOI]

Martin Farber

Zsolt Tuza

SIAM J. Discret. Math., 1993

Weighted Independent Perfect Domination on Cocomparability Graphs.

[BibT_eX]

[DOI]

C. Pandu Rangan

Satyan R. Coorg

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992

Set to Set Broadcasting in Communication Networks.

[BibT_eX]

[DOI]

Hsun-Ming Lee

Discret. Appl. Math., 1992

1991

Centers of chordal graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1991

1990

The Domatic Number Problem in Interval Graphs.

[BibT_eX]

[DOI]

Tung-Lin Lu

Pei-Hsin Ho

SIAM J. Discret. Math., 1990

An upper bound for the transversal numbers of 4-uniform hypergraphs.

[BibT_eX]

[DOI]

Feng-Chu Lai

J. Comb. Theory B, 1990

1989

On the Number of SDR of a (t, n)-family.

[BibT_eX]

[DOI]

Eur. J. Comb., 1989

1988

Labeling algorithms for domination problems in sun-free chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1988

1985

Diagonal and Pandiagonal Tournament Latin Squares.

[BibT_eX]

[DOI]

Eur. J. Comb., 1985

1982

R-domination on block graphs.

[BibT_eX]

[DOI]

George L. Nemhauser

Oper. Res. Lett., 1982

Group testing with two defectives.

[BibT_eX]

[DOI]

Shen Lin

Discret. Appl. Math., 1982

1980

A Group Testing Problem.

[BibT_eX]

[DOI]