This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.
✦ LIBER ✦
A simple proof of Gagliardi's handle recognition theorem
✍ Scribed by Sóstenes Lins
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 430 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
Recently Gagliardi has proved a theorem on recognizing handles in 3-manifolds crystallizations . The purpose of this note is to present a short proof of this result which follows as a corollary of Theorem 2 and to introduce a more general definition of combinatorial handle, crucial for the proof. We also present a crystallization which settles two questions posed in . * Work supported by UFPE, CNPq (contract number 30.1103/80) and FINEP.
📜 SIMILAR VOLUMES
A simple proof of Moser's theorem
✍
Zhu, Xuding
📂
Article
📅
1999
🏛
John Wiley and Sons
🌐
English
⚖ 243 KB
👁 2 views
A simple proof of Menger's theorem
✍
William McCuaig
📂
Article
📅
1984
🏛
John Wiley and Sons
🌐
English
⚖ 111 KB
👁 1 views
## Abstract A proof of Menger's theorem is presented.
A simple proof of Pancharatnam's theorem
✍
P.K. Aravind
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 465 KB
A simple proof of A. F. Timan's theorem
✍
Heinz-Gerd Lehnhoff
📂
Article
📅
1983
🏛
Elsevier Science
🌐
English
⚖ 189 KB
Another simple proof of Kirchberger's th
✍
R.J Webster
📂
Article
📅
1983
🏛
Elsevier Science
🌐
English
⚖ 102 KB
A simple proof of Gabriel and Popesco's
✍
Mitsuhiro Takeuchi
📂
Article
📅
1971
🏛
Elsevier Science
🌐
English
⚖ 61 KB