Gated independence in graphs

DOI10.1016/j.dam.2024.04.011zbMATH Open1542.05136MaRDI QIDQ6546421

Zakir Deniz, Mehmet Akif Yetim, Yusuf Civan

Publication date: 29 May 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

dominationuniquely restricted matchinginduced matchinggated independent set

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Relations between packing and covering numbers of a tree
• Lower bounds on the uniquely restricted matching number
• A tree version of Kőnig's theorem
• The EKR property for flag pure simplicial complexes without boundary
• 1-well-covered graphs revisited
• Uniquely restricted matchings in subcubic graphs
• On the corona of two graphs
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• Tight lower bounds on the matching number in a graph with given maximum degree
• Lower bound on the domination number of a tree
• Coloring the square of a planar graph
• Vertex-edge domination in graphs
• Uniquely restricted matchings
• On reconfiguration graphs of independent sets under token sliding

This page was built for publication: Gated independence in graphs