Maximal independent sets in bipartite graphs

DOI10.1002/JGT.3190170407zbMATH Open0783.05063OpenAlexW1966320878MaRDI QIDQ3137766FDOQ3137766

Authors: Jiuqiang Liu 

Publication date: 13 October 1993

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190170407

Recommendations

• scientific article; zbMATH DE number 6257565
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza
• The number of maximal independent sets in connected triangle-free graphs
• Maximal independent sets in bipartite graphs obtained from Boolean lattices

zbMATH Keywords

bipartite graphextremal graphsmaximal independent sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• A Note on Independent Sets in Trees

Cited In (40)

• Maximal independent sets in bipartite graphs obtained from Boolean lattices
• Maximal independent sets and regularity of graphs
• Maximal independent sets in grid graphs
• Maximum dissociation sets in subcubic trees
• Bipartite graphs can have any number of independent sets
• A finiteness theorem for maximal independent sets
• On the maximum number of maximum independent sets of bipartite graphs
• On radius 2 trees with the maximum number of matchings
• Fixed points and maximal independent sets in AND-OR networks
• Dense induced bipartite subgraphs in triangle-free graphs
• Maximum number of fixed points in AND-OR-NOT networks
• Trees with maximum number of maximal matchings
• Bipartite independence number in graphs with bounded maximum degree
• On a problem of Harary
• On graphs admitting two disjoint maximum independent sets
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• Maximal and maximum dissociation sets in general and triangle-free graphs
• On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number
• Independent sets in graphs
• Trees without twin-leaves with smallest number of maximal independent sets
• An upper bound for the number of maximal independent sets in a graph
• On the number of maximal bipartite subgraphs of a graph
• Maximal independent sets in clique-free graphs
• Arithmetically maximal independent sets in infinite graphs
• On the maximum number of maximum dissociation sets in trees with given dissociation number
• Nontrivial independent sets of bipartite graphs and cross-intersecting families
• Facets for node packing
• Solving the anti-covering location problem using Lagrangian relaxation
• Title not available (Why is that?)
• On the number of \(k\)-dominating independent sets in planar graphs
• Title not available (Why is that?)
• Graphs with the second largest number of maximal independent sets
• Hitting all maximal independent sets of a bipartite graph
• Coverings, matchings and the number of maximal independent sets of graphs
• Extremal bipartite independence number and balanced coloring
• On trees of bounded degree with maximal number of greatest independent sets
• Maximal independent sets in caterpillar graphs
• Trees with a given number of leaves and the maximal number of maximum independent sets
• The number of maximal independent sets in connected triangle-free graphs
• Maximal independent sets in graphs with at most one cycle

This page was built for publication: Maximal independent sets in bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137766)