A local criterion for Tverberg graphs
✍ Scribed by Alexander Engström
- Publisher
- Springer-Verlag
- Year
- 2011
- Tongue
- English
- Weight
- 202 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let G be a graph, and let H be a connected subgraph of G. When it is known that the graph G/H (obtained from G by contracting H to a vertex) has a spanning eulerian subgraph, under what conditions can it be inferred that G itself has a spanning eulerian subgraph? 0 1996 John Wiley & Sons, Inc.
## Abstract Let __q__ be a prime power, 𝔽~__q__~ be the field of __q__ elements, and __k__, __m__ be positive integers. A bipartite graph __G__ = __G~q~__(__k__, __m__) is defined as follows. The vertex set of __G__ is a union of two copies __P__ and __L__ of two‐dimensional vector spaces over 𝔽~__
In a recent paper, Carsten Thomassen [Carsten Thomassen, Planarity and duality of finite and infinite graphs. J. Combinatorial Theory Ser. B 29 (1980) 244-2711 has shown that a number of criteria for the planarity of a graph can be reduced to that of Kuratowski. Here we present another criterion whi
## Abstract Direct proofs of some planarity criteria are presented.