Note on projective graphs
✍ Scribed by Tomasz Łuczak; Jaroslav Nešetřil
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 69 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We show that all graphs with a simple extension property are projective. As a consequence of this result we settle in the affirmative a conjecture of Larose and Tardif and characterize all homogeneous graphs which are projective. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 81–86, 2004
📜 SIMILAR VOLUMES
A geometric graph is a graph drawn in the plane so that the vertices are represented by points in general position and the edges are represented by straight line segments connecting the corresponding points. We show that a geometric graph of n vertices with no k+1 pairwise disjoint edges has at most
We construct a family of 4-chromatic graphs which embed on the projective plane, and characterize the edge-critical members. The family includes many well known graphs, and also a new sequence of graphs, which serve to improve Gallai's bound on the length of the shortest odd circuit in a 4-chromatic
## Abstract An application of conservative graphs to topological graph theory is indicated.
## Abstract Coset graphs are a generalization of Cayley graphs. They arise in the construction of graphs and digraphs with transitive automorphism groups. Moreover, the consideration of coset graphs makes it possible to give an algebraic description of regular connected graphs of even degree. In th
## Abstract We show that the problem raised by Boesch, Suffel, and Tindell of determining whether or not a graph is spanned by an Eulerian subgraph is NP‐complete. We also note that there does exist a good algorithm for determining if a graph is spanned by a subgraph having positive even degree at