Thatte, Bhalchandra D
(1995)
*Some results on the reconstruction problems. p-claw-free, chordal, and p4-reducible graphs.*
In: Journal of Graph Theory, 19
(4).
pp. 549-561.

## Abstract

A claw is an induced subgraph isomorphic to K-1,K-3. The claw-point is the point of degree 3 in a claw. A graph is called p-claw-free when no p-cycle has a claw-point on it. It is proved that for p greater than or equal to 4, p-claw-free graphs containing at least one chordless p-cycle are edge reconstructible. It is also proved that chordal graphs are edge reconstructible. These two results together imply the edge reconstructibility of claw-free graphs. A simple proof of vertex reconstructibility of P-4-reducible graphs is also presented. (C) 1995 John Wiley and Sons, Inc.

Item Type: | Journal Article |
---|---|

Related URLs: | |

Additional Information: | Copyright of this article belongs to John Wiley and Sons. |

Department/Centre: | Division of Physical & Mathematical Sciences > Mathematics |

Date Deposited: | 26 May 2011 06:24 |

Last Modified: | 26 May 2011 06:24 |

URI: | http://eprints.iisc.ernet.in/id/eprint/37909 |

### Actions (login required)

View Item |