Edge annihilation sequences for classes of chordal graphs
Given a non-empty graph G=(VE) of order n and size m, with some property P, we may ask whether there exists a sequence of graphs constructed by the sequential removal of edges e1, e2,...,em, with the property that if Go=G then (1) Gi is obtained from G(i-1) by deletion of exactly one edge and (2) Gi...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
Monterey, California. Naval Postgraduate School
2013
|
| Online Access: | http://hdl.handle.net/10945/32064 |