A Note on Contractible Edges in Chordal Graphs
Discrete Mathematics
2009-02-10 v1
Abstract
Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a -connected graph is {\em contractible} if its contraction does not result in a graph of lower connectivity. We characterize contractible edges in chordal graphs using properties of tree decompositions with respect to minimal vertex separators.
Cite
@article{arxiv.0902.1364,
title = {A Note on Contractible Edges in Chordal Graphs},
author = {N. S. Narayanaswamy and N. Sadagopan and Apoorve Dubey},
journal= {arXiv preprint arXiv:0902.1364},
year = {2009}
}