@inproceedings{0119b3f2ec9f4a3c908d2339d0a261a7,
title = "Critical and maximum independent sets revisited",
abstract = "Let G be a simple graph with vertex set V(G). A set (formula presented) is independent if no two vertices from S are adjacent, and by (formula presented) we mean the family of all independent sets of G. The number (formula presented) is the difference of (formula presented), and a set (formula presented) is critical if (formula presented) [34]. Let us recall the following definitions: (formula presented) [16],(formula presented) [5],(formula presented) [18],(formula presented) [12](formula presented) [24]. In this paper we focus on interconnections between (formula presented), core, corona, (formula presented), and diadem.",
keywords = "Core, Corona, Critical set, Diadem, Independent set, Ker, Matching",
author = "Levit, \{Vadim E.\} and Eugen Mandrescu",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019 ; Conference date: 08-07-2019 Through 12-07-2019",
year = "2019",
doi = "10.1007/978-3-030-22629-9\_1",
language = "אנגלית",
isbn = "9783030226282",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "3--18",
editor = "Michael Khachay and Yury Kochetov and Panos Pardalos",
booktitle = "Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings",
}