A Note on Contractible Edges in Chordal Graphs

Simple item page
dc.creatorNarayanaswamy, N. S.
dc.creatorSadagopan, N.
dc.creatorDubey, Apoorve
dc.date2009-02-09
dc.date.accessioned2026-07-07T12:39:24Z
dc.date.available2026-07-07T12:39:24Z
dc.descriptionContraction 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.
dc.identifierhttps://arxiv.org/abs/0902.1364
dc.identifierhttp://arxiv.org/abs/0902.1364
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219099
dc.subjectDiscrete Mathematics
dc.titleA Note on Contractible Edges in Chordal Graphs
dc.typetext

Files

Collections

arXiv