Computer Science – Discrete Mathematics
Scientific paper
2009-02-09
Computer Science
Discrete Mathematics
Scientific paper
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 $k$-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.
Dubey Apoorve
Narayanaswamy N. S.
Sadagopan N.
No associations
LandOfFree
A Note on Contractible Edges in Chordal Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Note on Contractible Edges in Chordal Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Contractible Edges in Chordal Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-176020