Coverings, Matchings and the number of maximal independent sets of graphs

zbMath1411.05220arXiv1610.06058MaRDI QIDQ5377038

Do Trong Hoang, Tran Nam Trung

Publication date: 23 May 2019

Full work available at URL: https://arxiv.org/abs/1610.06058

zbMATH Keywords

matching numbersKönig-Egerváry graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Systems of parameters and the Cohen-Macaulay property ⋮ Maximal independent sets and regularity of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic study on Cameron-Walker graphs
• The maximum number of maximal independent sets in unicyclic connected graphs
• The number of maximal independent sets in a connected graph
• The number of maximal independent sets in connected triangle-free graphs
• The graphs with maximum induced matching and maximum matching the same size
• Maximal independent sets in bipartite graphs
• Maximal independent sets in graphs with at mostr cycles
• Maximal and maximum independent sets in graphs with at mostr cycles
• The Number of Maximal Independent Sets in a Tree
• A Note on Independent Sets in Trees
• The number of maximal independent sets in connected graphs
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• On cliques in graphs

This page was built for publication: Coverings, Matchings and the number of maximal independent sets of graphs