This article is motivated by a conjecture of Thomassen and Toft on the number s 2 (G) of separating vertex sets of cardinality 2 and the number v 2 (G) of vertices of degree 2 in a graph G belonging to the class G of all 2-connected graphs without nonseparating induced cycles. Let G denote the numbe
On a Conjecture of Kleene and Post
β Scribed by S. Barry Cooper
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 377 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The cyclic chromatic number Ο c (G) of a 2-connected plane graph G is the minimum number of colors in an assigment of colors to the vertices of G such that, for every face-bounding cycle f of G, the vertices of f have different colors. Plummer and Toft proved that, for a 3-connected plane graph G, u
A graph H is a cover of a graph G, if there exists a mapping Ο from V (H) onto V (G) such that for every vertex v of G, Ο maps the neighbors of v in H bijectively onto the neighbors of Ο(v) in G. Negami conjectured in 1987 that a connected graph has a finite planar cover if and only if it embeds in
It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k β₯ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n β₯ 3k, i.e., M (k) β€ 3k. W
**'A wonderful book' Patti Smith** ** **Simone Weil: famous French philosopher, writer, political activist, mystic - and sister to AndrΓ©, one of the most influential mathematicians of the twentieth century. For Karen Olsson, who studied mathematics at Harvard only to turn to writing as a vocatio