✦ LIBER ✦

A note on colorings of finite planes

✍ Scribed by Jerald A. Kabell

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 88 KB
Volume: 44
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90198-x

No coin nor oath required. For personal study only.

✦ Synopsis

By counting arguments we show that certain partitions of the points of finitle projective and aftine planes are not possible.

📜 SIMILAR VOLUMES

On colorings of finite projective planes

✍ Charles H. Jepsen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Using counting arguments we extend previous results concerning the coloring of lines in a finite projective plane of order n whose points are n-colored. Suppose the points of the finite projective plane PG(2, n) are colored with n colors. Kabell [2] showed that at least one line must contain points

A note on list-colorings

✍ Amanda Chetwynd; Roland Häggkvist 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB

In this article we discuss the current results on the list chromatic conjecture and prove that if G is a triangle free graph with maximum degree A then xi(G) 5 9A/5. If the term "a classic" can be used about a mathematical problem less than 10 years old, then surely the following question by Jeff D

A note on group colorings

✍ Daniel Král'; Ondřej Pangrác; Heinz-Jürgen Voss 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB

## Abstract We study a concept of group coloring introduced by Jaeger et al. We show that the group chromatic number of a graph with minimum degree δ is greater than δ/(2, ln δ) and we answer several open questions on the group chromatic number of planar graphs: a construction of a bipartite planar

Note on the structure of semiovals in fi

Note on the structure of semiovals in finite projective planes

✍ A. Blokhuis; T. Szőnyi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 318 KB

A note on defective colorings of graphs

A note on defective colorings of graphs in surfaces

✍ Dan Archdeacon 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

A graph is (rn, k)-colorable if its vertices can be colored with rn colors in such a way that each vertex is adjacent to at most k vertices of the same color as itself. In a recent paper Cowen. Cowen, and Woodall proved that, for each compact surface S, there exists an integer k = k(S) such that eve

A Note on Graph Colorings and Graph Poly

A Note on Graph Colorings and Graph Polynomials

✍ Noga Alon; Michael Tarsi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 230 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using