On bipartite tetravalent graphs
β Scribed by D.H. Smith
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 560 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
In [ IO, 1 I 1 all non-bipartite distance-transitive graphs of vallency four have been determined.
e use a result of Gardinrzr [ 4 ] to enable us to determine thf: bipar ite distance-transitive graphs of valency four. We wx tht definitio s and notation o H wish to exp C'ollege, withou ould not have been completed. ide
.
π SIMILAR VOLUMES
It is proved that there is a function f: N Q N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-width \ f(g). Then (i) If every contractible 4-cycle of G is facial and there is a face of size > 4, then G is 3-colorable.
If the vertices of a graph G are partitioned into k classes V~, I/2 ..... Vk such that each V~ is an independent set and I1V~I-IV~[I ~< 1 for all i#j, then G is said to be equitably colored with k colors. The smallest integer n for which G can be equitably colored with n colors is called the equitab
NeSetfil, J. and V. Riidl, On Ramsey graphs without bipartite subgraphs, Discrete Mathematics 101 (1992) 223-229. We prove that for every graph H without triangles and K,,,,,m, n G 2, there exists a Ramsey graph with the same properties. This answers a problem due to Erd& and Faudree. Moreover we