A decomposition for a class of (P5,P̄5)-free graphs
✍ Scribed by J.L. Fouquet
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 598 KB
- Volume
- 121
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
Fouquet, J.L., A decomposition for a class of (P,, P,)-free graphs, Discrete Mathematics 121 (1993) 75-83.
We give a decomposition for a subclass of (P5, P, )-free graphs, leading to an 0(n3) algorithm for the recognition of this class of graphs.
📜 SIMILAR VOLUMES
The chemical synthesis of adenylyl-(2-5')-adenylyl-(2-5')-8-azidoadenosine (15) was performed by the phosphotriester approach. Enzymatic phosphorylation of 15 by [y -3ZP]ATP led to the corresponding labelled 5'monophosphate 16. Photoinsertion of 16 took place on UV irradiation by covalent cross link
MaruSiE, D. and R. Scapellato, A class of non-Cayley vertex-transitive graphs associated with PSL(2, p), Discrete Mathematics 109 (1992) 161-170. A construction for a class of non-Cayley vertex-transitive graphs associated with PSL(2,p) acting by right multiplication on the right cosets of a dihedr