Counterexamples to a conjecture of Tamaschke
โ Scribed by E.C Dade
- Publisher
- Elsevier Science
- Year
- 1969
- Tongue
- English
- Weight
- 247 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We give a counterexample to the following conjecture of Douglas D. Grant Cl]: If a positive integer t 3 2 and D is a strict digraph of order 2t such that S+(D) 3 t and S'(D)2 t, then D has an anti-directed hamiltonian cycle. Where S+(D) and 6-(D) denote the minimum indegree and outdegree, respective
A pair of vertices (x, y) of a graph G is an ฯ-critical pair if ฯ(G + xy) > ฯ(G), where G + xy denotes the graph obtained by adding the edge xy to G and ฯ(H) is the clique number of H. The ฯ-critical pairs are never edges in G. A maximal stable set S of G is called a forced color class of G if S mee