A Note on Contractible Edges in Chordal Graphs

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-176020

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.