Vertices Belonging to All Critical Sets of a Graph

DOI10.1137/110823560zbMath1246.05122arXiv1102.0401OpenAlexW2031361115MaRDI QIDQ2902909

Eugen Mandrescu, Vadim E. Levit

Publication date: 22 August 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

independent setmaximum matchingcritical setcritical difference

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) 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 (13)

On some conjectures concerning critical independent sets of a graph ⋮ Critical independent sets of König-Egerváry graphs ⋮ On the critical difference of almost bipartite graphs ⋮ Critical sets in bipartite graphs ⋮ Critical and maximum independent sets of a graph ⋮ On critical difference, independence number and matching number of graphs ⋮ Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions ⋮ Problems on matchings and independent sets of a graph ⋮ Contraction and deletion blockers for perfect graphs and \(H\)-free graphs ⋮ On König-Egerváry collections of maximum critical independent sets ⋮ On the intersection of all critical sets of a unicyclic graph ⋮ Monotonic properties of collections of maximum independent sets of a graph ⋮ On an annihilation number conjecture

This page was built for publication: Vertices Belonging to All Critical Sets of a Graph