Ko-Wei Lih

Discret. Appl. Math., 2022

2021

IC-Planar Graphs Are 6-Choosable.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

2020

Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

2019

A note on m-near-factor-critical graphs.

[BibT_eX]

[DOI]

Kuo-Ching Huang

Eur. J. Comb., 2019

On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces.

[BibT_eX]

[DOI]

Junran Lichen

Jianping Li

Inf. Process. Lett., 2018

Upper bounds for the strong chromatic index of Halin graphs.

[BibT_eX]

[DOI]

Ziyu Hu

Discuss. Math. Graph Theory, 2018

2017

Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length.

[BibT_eX]

[DOI]

Junran Lichen

Jianping Li

Optim. Lett., 2017

2015

Full Orientability of the Square of a Cycle.

[BibT_eX]

Fengwei Xu

Ars Comb., 2015

Chordal Graphs are Fully Orientable.

[BibT_eX]

Ars Comb., 2015

Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time.

[BibT_eX]

[DOI]

Danjun Huang

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Approximation algorithms for solving the constrained arc routing problem in mixed graphs.

[BibT_eX]

[DOI]

Honglin Ding

Jianping Li

Eur. J. Oper. Res., 2014

An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph.

[BibT_eX]

[DOI]

Lianzhu Zhang

Discret. Appl. Math., 2014

Nordhaus-Gaddum-type relations of three graph coloring parameters.

[BibT_eX]

[DOI]

Kuo-Ching Huang

Discret. Appl. Math., 2014

When is the Direct Product of Generalized Mycielskians a Cover Graph?

[BibT_eX]

Ars Comb., 2014

2013

Acyclic List Edge Coloring of Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Preface: optimization in graphs.

[BibT_eX]

[DOI]

D. J. Guan

Xuding Zhu

J. Comb. Optim., 2013

Equivalence of two conjectures on equitable coloring of graphs.

[BibT_eX]

[DOI]

Chih-Hung Yen

J. Comb. Optim., 2013

Intersecting k-Uniform Families Containing all the k-Subsets of a Given Set.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

The strong chromatic index of Halin graphs.

[BibT_eX]

[DOI]

Ping-Ying Tsai

Discret. Math., 2012

On the strong chromatic index of cubic Halin graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2012

2011

Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six.

[BibT_eX]

[DOI]

Yuehua Bu

Discuss. Math. Graph Theory, 2011

2010

On preserving full orientability of graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

2009

Multi-color Ramsey numbers of even cycles.

[BibT_eX]

[DOI]

Yusheng Li

Eur. J. Comb., 2009

On (d, 1)-total numbers of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Full orientability of graphs with at most one dependent arc.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Coloring the square of the Kneser graph I and the Schrijver graph I.

[BibT_eX]

[DOI]

Jun-Yo Chen

Jiaojiao Wu

Discret. Appl. Math., 2009

On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

2008

Coupled choosability of plane graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

On fully orientability of 2-degenerate graphs.

[BibT_eX]

[DOI]

Gerard J. Chang

Inf. Process. Lett., 2008

Non-cover generalized Mycielski, Kneser, and Schrijver graphs.

[BibT_eX]

[DOI]

Chen-Ying Lin

Discret. Math., 2008

Note on Coloring the Square of an Outerplanar Graph.

[BibT_eX]

Ars Comb., 2008

2007

On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

2006

On an interpolation property of outerplanar graphs.

[BibT_eX]

[DOI]

Chen-Ying Lin

Discret. Appl. Math., 2006

2005

List Coloring Halin Graphs.

[BibT_eX]

Ars Comb., 2005

2004

The edge-face choosability of plane graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2004

The Linear 2-Arboricity of Outerplanar Graphs.

[BibT_eX]

Ars Comb., 2004

2003

Labeling Planar Graphs with Conditions on Girth and Distance Two.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

The Linear 2-Arboricity of Planar Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2003

Coloring the square of a K4-minor free graph.

[BibT_eX]

[DOI]

Xuding Zhu

Discret. Math., 2003

2002

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

Circular chromatic numbers of some reduced Kneser graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

Edge-partitions of planar graphs and their game coloring numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Edge-pancyclicity of coupled graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Choosability and edge choosability of planar graphs without five cycles.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2002

2001

An improvement on a spernerity proof of Horrocks.

[BibT_eX]

[DOI]

Szu-En Cheng

Theor. Comput. Sci., 2001

On Cycle Sequences.

[BibT_eX]

[DOI]

Jing-Ho Yan

Graphs Comb., 2001

Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2001

A note on list improper coloring planar graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2001

The 4-choosability of planar graphs without 6-cycles.

[BibT_eX]

[DOI]

Australas. J Comb., 2001

1999

Star Extremal Circulant Graphs.

[BibT_eX]

[DOI]

Xuding Zhu

SIAM J. Discret. Math., 1999

1997

Signed degree sequences of signed graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1997

1996

On equitable coloring of bipartite graphs.

[BibT_eX]

[DOI]

Pou-Lin Wu

Discret. Math., 1996

1995

Equitable and m-Bounded Coloring of Split Graphs.

[BibT_eX]

[DOI]

Ming-Tat Ko

Proceedings of the Combinatorics and Computer Science, 1995

1994

Equitable Coloring of Trees.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1994

Equitable Coloring and the Maximum Degree.

[BibT_eX]

[DOI]

Pou-Lin Wu

Eur. J. Comb., 1994

1993

A Note on the m-Bounded Chromatic Number of a Tree.

[BibT_eX]

[DOI]

Eur. J. Comb., 1993

Rank inequalities for chordal graphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

1990

Diameters of iterated clique graphs of chordal graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

1987

Hamiltonian uniform subset graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1987

1983

Latin Squares and Superqueens.

[BibT_eX]

[DOI]

Frank K. Hwang

J. Comb. Theory, Ser. A, 1983

1980

Sperner Families over a Subset.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1980

1978

Type Two Partial Degrees.

[BibT_eX]

[DOI]