If G is a claw-free graph, then there is a graph cl(G) such that (i) G is a spanning subgraph of cl(G), (ii) cl(G) is a line graph of a triangle-free graph, and (iii) the length of a longest cycle in G and in cl(G) is the same. A sufficient condition for hamiltonicity in claw-free graphs, the equiv
A new concept of primeness in graphs
✍ Scribed by R. H. Lamprey; B. H. Barnes
- Publisher
- John Wiley and Sons
- Year
- 1981
- Tongue
- English
- Weight
- 313 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract The concept of a matroid vertex is introduced. The vertices of a matroid of a 3‐connected graph are in one‐to‐one correspondence with vertices of the graph. Thence directly follows Whitney's theorem that cyclic isomorphism of 3‐connected graphs implies isomorphism. The concept of a vert
## Abstract ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a “Full Text” option. The original article is trackable v
## Abstract **Summary:** A novel type of catalysis, neither homogeneous nor heterogeneous, is presented. This new “mesogeneous catalysis” combines the high efficiency characteristic of the homogeneous process with the advantages of the heterogeneous one (i.e., the possibility of removing and reusin
This paper completes the determination of all integers of the form pqr (where p, q, and r are distinct primes) for which there exists a vertex-transitive graph on pqr vertices which is not a Cayley graph.