Skip to main content
SpringerLink
Log in

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

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

This paper designs a set of graph operations, and proves that for 2≤k/d<3, starting from K k / d , by repeatedly applying these operations, one can construct all graphs G with χ c (G)≥k/d. Together with the result proved in [20], where a set of graph operations were designed to construct graphs G with χ c (G)≥k/d for k/d≥3, we have a complete analogue of Hajós' Theorem for the circular chromatic number.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan, 80424

    Xuding Zhu

Authors
  1. Xuding Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xuding Zhu.

Additional information

This research was partially supported by the National Science Council under grant NSC 89-2115-M-110-003

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhu, X. An Analogue of Hajós' Theorem for the Circular Chromatic Number (II). Graphs and Combinatorics 19, 419–432 (2003). https://doi.org/10.1007/s00373-002-0505-9

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-002-0505-9

Keywords

Search

Navigation