Xuding Zhu

,

J. Graph Theory, 2005

Circular chromatic index of graphs of maximum degree 3.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Graph Theory, 2005

Graphs of Large Girth with Prescribed Partial Circular Colourings.

[BibT_eX]

[DOI]

,

Graphs Comb., 2005

Three classes of minimal circular-imperfect graphs.

[BibT_eX]

[DOI]

Arnaud Pêcher

,

Annegret K. Wagler

,

Electron. Notes Discret. Math., 2005

Coloring the Cartesian Sum of Graphs.

[BibT_eX]

[DOI]

,

Electron. Notes Discret. Math., 2005

Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks.

[BibT_eX]

[DOI]

W. R. Chen

,

Frank K. Hwang

,

SIAM J. Discret. Math., 2004

Density of the circular chromatic numbers of series-parallel graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2004

Fractional chromatic number and circular chromatic number for distance graphs with large clique size.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2004

On sparse graphs with given colorings and homomorphisms.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2004

Sparse H-Colourable Graphs of Bounded Maximum Degree.

[BibT_eX]

[DOI]

,

Graphs Comb., 2004

Relaxed game chromatic number of trees and outerplanar graphs.

[BibT_eX]

[DOI]

Wenjie He

,

Jiaojiao Wu

,

Discret. Math., 2004

Incidence coloring of k-degenerated graphs.

[BibT_eX]

[DOI]

Mohammad Hosseini Dolama

,

Éric Sopena

,

Discret. Math., 2004

Construction of graphs with given circular flow numbers.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2003

Circular chromatic number and Mycielski construction.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2003

Circular chromatic number of subgraphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2003

Circular chromatic number of Kneser graphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2003

An Analogue of Hajós' Theorem for the Circular Chromatic Number (II).

[BibT_eX]

[DOI]

Graphs Comb., 2003

Circular chromatic numbers of a class of distance graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

4-Colorable 6-regular toroidal graphs.

[BibT_eX]

[DOI]

Hong-Gwa Yeh

,

Discret. Math., 2003

Coloring the square of a K4-minor free graph.

[BibT_eX]

[DOI]

Ko-Wei Lih

,

Wei-Fan Wang

,

Discret. Math., 2003

Construction of Kn-minor free graphs with given circular chromatic number.

[BibT_eX]

[DOI]

Sheng-Chyang Liaw

,

,

Discret. Math., 2003

Relaxed game chromatic number of graphs.

[BibT_eX]

[DOI]

Chun-Yen Chou

,

Wei-Fan Wang

,

Discret. Math., 2003

Circulant Distant Two Labeling and Circular Chromatic Number.

[BibT_eX]

,

Ars Comb., 2003

Circular chromatic number of distance graphs with distance sets of cardinality 3.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

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

[BibT_eX]

[DOI]

,

,

,

,

,

J. Graph Theory, 2002

Circular Colouring and Orientation of Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

Asymptotic Clique Covering Ratios of Distance Graphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2002

The level of nonmultiplicativity of graphs.

[BibT_eX]

[DOI]

Claude Tardif

,

Discret. Math., 2002

On Hedetniemi's conjecture and the colour template scheme.

[BibT_eX]

[DOI]

Claude Tardif

,

Discret. Math., 2002

The circular chromatic number of series-parallel graphs of large odd girth.

[BibT_eX]

[DOI]

,

Discret. Math., 2002

Tight relation between the circular chromatic number and the girth of series-parallel graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2002

Preface.

[BibT_eX]

[DOI]

Frank K. Hwang

,

Discret. Math., 2002

Game chromatic index of k-degenerate graphs.

[BibT_eX]

[DOI]

Leizhen Cai

,

J. Graph Theory, 2001

Circular chromatic number: a survey.

[BibT_eX]

[DOI]

Discret. Math., 2001

Construction of sparse graphs with prescribed circular colorings.

[BibT_eX]

[DOI]

,

Discret. Math., 2001

Circular Chromatic Number of Planar Graphs of Large Odd Girth.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

The circular chromatic number of series-parallel graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2000

The circular chromatic number of series-parallel graphs with large girth.

[BibT_eX]

[DOI]

Chihyun Chien

,

J. Graph Theory, 2000

The game coloring number of pseudo partial k-trees.

[BibT_eX]

[DOI]

Discret. Math., 2000

Pseudo-Hamiltonian-connected graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2000

Star Extremal Circulant Graphs.

[BibT_eX]

[DOI]

Ko-Wei Lih

,

,

SIAM J. Discret. Math., 1999

A simple proof of Moser's theorem.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Construction of uniquely H-colorable graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Distance graphs with missing multiples in the distance sets.

[BibT_eX]

[DOI]

,

J. Graph Theory, 1999

Game chromatic number of outerplanar graphs.

[BibT_eX]

[DOI]

D. J. Guan

,

J. Graph Theory, 1999

The Game Coloring Number of Planar Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

Planar Graphs with Circular Chromatic Numbers between 3 and 4.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

Distance Graphs and T-Coloring.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 1999

A bound for the game chromatic number of graphs.

[BibT_eX]

[DOI]

Thomas Dinski

,

Discret. Math., 1999

Circular chromatic numbers of Mycielski's graphs.

[BibT_eX]

[DOI]

,

Lingling Huang

,

Discret. Math., 1999

Graphs Whose Circular Chromatic Number Equals the Chromatic Number.

[BibT_eX]

[DOI]

Comb., 1999

Multiple Capacity Vehicle Routing on Paths.

[BibT_eX]

[DOI]

D. J. Guan

,

SIAM J. Discret. Math., 1998

Oriented walk double covering and bidirectional double tracing.

[BibT_eX]

[DOI]

Hongbing Fan

,

J. Graph Theory, 1998

Pattern Periodic Coloring of Distance Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

Minimal Oriented Graphs of Diameter 2.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 1998

Relaxed Coloring of a Graph.

[BibT_eX]

[DOI]

Walter A. Deuber

,

Graphs Comb., 1998

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs.

[BibT_eX]

[DOI]

,

Lingling Huang

,

Eur. J. Comb., 1998

Chromatic Ramsey numbers.

[BibT_eX]

[DOI]

Discret. Math., 1998

Acyclic and oriented chromatic numbers of graphs.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

,

Éric Sopena

,

J. Graph Theory, 1997

A Coloring Problem for Weighted Graphs.

[BibT_eX]

[DOI]

D. J. Guan

,

Inf. Process. Lett., 1997

The chromatic numbers of distance graphs.

[BibT_eX]

[DOI]

Walter A. Deuber

,

Discret. Math., 1997

Multiplicativity of Acyclic Local Tournaments.

[BibT_eX]

[DOI]

,

Comb., 1997

A note on graph reconstruction.

[BibT_eX]

Ars Comb., 1997

Uniquely H-colorable graphs with large girth.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

On bounded treewidth duality of graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 1996

Circular colorings of weighted graphs.

[BibT_eX]

[DOI]

Walter A. Deuber

,

J. Graph Theory, 1996

On the bounds for the ultimate independence ratio of a graph.

[BibT_eX]

[DOI]

Discret. Math., 1996

Star-extremal graphs and the lexicographic product.

[BibT_eX]

[DOI]

Guogang Gao

,

Discret. Math., 1996

Complexity of Tree Homomorphisms.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 1996

Star Chromatic Numbers of Graphs.

[BibT_eX]

[DOI]

Eckhard Steffen

,

Comb., 1996

The Existence of Homomorphisms to Oriented Cycles.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 1995

On homomorphisms to acyclic local tournaments.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 1995

A Polynomial Algorithm for Homomorphisms to Oriented Cycles.

[BibT_eX]

[DOI]

J. Algorithms, 1995

Ramsey Families which Exclude a Graph.

[BibT_eX]

[DOI]

Vojtech Rödl

,

Norbert Sauer

,

Comb., 1995

Multiplicativity of Oriented Cycles.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 1994

Homomorphisms to oriented paths.

[BibT_eX]

[DOI]

,

Discret. Math., 1994

Homomorphisms to oriented cycles.

[BibT_eX]

[DOI]

,

,

Comb., 1993

Star chromatic numbers and products of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1992

A simple proof of the multiplicativity of directed cycles of prime power length.

[BibT_eX]

[DOI]