✦ LIBER ✦

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

✍ Scribed by Xuding Zhu

Book ID: 106047450
Publisher: Springer Japan
Year: 2003
Tongue: English
Weight: 526 KB
Volume: 19
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-002-0505-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromatic number, clique subdivisions, a

Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz

✍ Jacob Fox, Choongbum Lee, Benny Sudakov 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 224 KB

A topological lower bound for the circul

A topological lower bound for the circular chromatic number of Schrijver graphs

✍ Meunier, Frédéric (author) 📂 Article 📅 2005 🏛 Wiley-Liss Inc. 🌐 English ⚖ 66 KB 👁 1 views

## Abstract In this paper, we prove that the Kneser graphs defined on a ground set of __n__ elements, where __n__ is even, have their circular chromatic numbers equal to their chromatic numbers. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 257–261, 2005

A topological lower bound for the circul

A topological lower bound for the circular chromatic number of Schrijver graphs

✍ Meunier, Frédéric (author) 📂 Article 📅 2005 🏛 Wiley-Liss Inc. 🌐 English ⚖ 66 KB

An analogue of Beurling’s theorem for th

An analogue of Beurling’s theorem for the Jacobi transform

✍ Ji Zheng Huang; He Ping Liu; Jian Ming Liu 📂 Article 📅 2008 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 206 KB

An analogue of Stickelberger's theorem f

An analogue of Stickelberger's theorem for the higherK-groups

✍ J. Coates; W. Sinnott 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 551 KB

The algebra of set functions II: An enum

The algebra of set functions II: An enumerative analogue of Hall’s theorem for bipartite graphs

✍ Bodo Lass 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 257 KB