The maximum number of maximum generalized 4-independent sets in trees

DOI10.1002/JGT.23122zbMATH Open1548.05184MaRDI QIDQ6606325FDOQ6606325

Min Xu, Pingshan Li

Publication date: 16 September 2024

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

zbMATH Keywords

tree\(k\)-independent setsdissociation setsKönig-Egerváry graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• On the \(k\)-path vertex cover of some graph products
• Minimum \(k\)-path vertex cover
• NP-hard graph problems and boundary classes of graphs
• On cliques in graphs
• Node-Deletion Problems on Bipartite Graphs
• Title not available (Why is that?)
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• The number of maximal independent sets in a connected graph
• The number of maximal independent sets in connected graphs
• The structure and maximum number of maximum independent sets in trees
• Maximal independent sets in graphs with at mostr cycles
• The Number of Maximal Independent Sets in a Tree
• A Note on Independent Sets in Trees
• Independent packings in structured graphs
• Maximal independent sets in graphs with at most one cycle
• Maximal and maximum independent sets in graphs with at mostr cycles
• The maximum number of maximal independent sets in unicyclic connected graphs
• The complexity of dissociation set problems in graphs
• An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth
• The maximum number of maximum dissociation sets in trees

This page was built for publication: The maximum number of maximum generalized 4-independent sets in trees

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