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.
On a class of square-free graphs
β Scribed by Xue Qingbo
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 171 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A class of translation planes of order q2, where q =pr, p is a prime, p I>7, p~=t=l (mod 10) and r is an odd natural number is constructed and the translation complements of these planes are determined. A property shared by all these planes is that the translation complement fixes a distinguished po
## Abstract Let __m__ and __n__ be nonnegative integers. Denote by __P__(__m,n__) the set of all triangleβfree graphs __G__ such that for any independent __m__βsubset __M__ and any __n__βsubset __N__ of __V__(__G__) with __M__ β© __N__ = Γ, there exists a unique vertex of __G__ that is adjacent to e
Let S be an arbitrary collection of stars in a graph G such that there is no chain of length ~3 joining the centers of (any) two stars in G. We consider the graphs that can be obtained by deleting in a parity graph all the edges of such a set S. These graphs will be called skeletal graphs and we pro