Maximal independent sets in caterpillar graphs
type: Item
instance of: scholarly article
title: Maximal independent sets in caterpillar graphs
zbMATH Open document ID: 1236.05154
author: Mónica Villanueva
author: Carmen Z. Ortiz
published in: Discrete Applied Mathematics
publication date: 2012-03-19T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 6015807
zbMATH Keywords: graph algorithms
zbMATH Keywords: caterpillar graph
zbMATH Keywords: enumeration of maximal independent sets
zbMATH Keywords: intersection graph
zbMATH Keywords: independent graph
zbMATH Keywords: clique graph
MaRDI profile type: Publication
full work available at URL: j.dam.2011.10.024
OpenAlex ID: W2069114326
cites work: The Transitive Reduction of a Directed Graph
cites work: The number of maximal independent sets in connected triangle-free graphs
cites work: Algorithms and Computation
cites work: The number of maximal independent sets in connected graphs
cites work: Maximal independent sets in graphs with at mostr cycles
cites work: The number of maximal independent sets in a connected graph
cites work: Q5668506
cites work: An efficient algorithm to generate all maximal independent sets on trapezoid graphs
cites work: The Number of Maximal Independent Sets in Triangle-Free Graphs
cites work: On generating all maximal independent sets
cites work: Maximal independent sets in graphs with at most one cycle
cites work: A finiteness theorem for maximal independent sets
cites work: The maximum number of maximal independent sets in unicyclic connected graphs
cites work: Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
cites work: Maximal independent sets in bipartite graphs
cites work: Tree-thickness and caterpillar-thickness under girth constraints
cites work: A new backtracking algorithm for generating the family of maximal independent sets of a graph
cites work: A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
cites work: On cliques in graphs
cites work: Counting the number of independent sets in chordal graphs
cites work: The number of independent sets in unicyclic graphs
cites work: A Note on Independent Sets in Trees
cites work: Maximal and maximum independent sets in graphs with at mostr cycles
cites work: Q4407448
cites work: A New Algorithm for Generating All the Maximal Independent Sets
cites work: The complexity of computing the permanent
cites work: The Number of Maximal Independent Sets in a Tree
cites work: Trees with extremal numbers of maximal independent sets including the set of leaves
cites work: Generate all maximal independent sets in permutation graphs
DOI: 10.1016/J.DAM.2011.10.024
description: scientific article; zbMATH DE number 6015807