On the structure of the minimum critical independent set of a graph

DOI10.1016/J.DISC.2012.12.008zbMath1262.05088arXiv1102.1859OpenAlexW1637433852MaRDI QIDQ1939576

Eugen Mandrescu, Vadim E. Levit

Publication date: 4 March 2013

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

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

zbMATH Keywords

matchingcoreindependent setkernelcritical set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

On the critical difference of almost bipartite graphs ⋮ Critical and maximum independent sets of a graph ⋮ On critical difference, independence number and matching number of graphs ⋮ Problems on matchings and independent sets of a graph ⋮ On the intersection of all critical sets of a unicyclic graph ⋮ Monotonic properties of collections of maximum independent sets of a graph

This page was built for publication: On the structure of the minimum critical independent set of a graph