Maximal independent sets in a generalisation of caterpillar graph
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-015-9960-0
Abstract: A caterpillar graph is a tree which on removal of all its pendant vertices leaves a chordless path. The chordless path is called the backbone of the graph. The edges from the backbone to the… read more here.
Keywords: sets generalisation; maximal independent; generalisation caterpillar; graph ... See more keywords