On Almost Bipartite Non-König-Egerváry Graphs

被引：0

作者：

Levit, Vadim E. ^{[1
]}

Mandrescu, Eugen ^{[2
]}

机构：

[1] Department of Mathematics, Ariel University, Israel

[2] Department of Computer Science, Holon Institute of Technology, Israel

来源：

SSRN | 2023年

关键词：

\textrm{core}$\left( G\right) $ be theintersection of all maximum independent sets;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

N\left( v\right) \cap A\neq\emptyset\right\} $). It is known that theinequality $\alpha(G)-\mu(G)\leq d\left( G\right) $ holds for every graph\cite{Levman2011a

引用

共 16 条

[1] On almost bipartite non-König-Egerváry graphs
Levit, Vadim E.
Mandrescu, Eugen
DISCRETE APPLIED MATHEMATICS, 2025, 366 : 127 - 134
[2] König–Egerváry Graphs are Non-Edmonds
P. Mark Kayll
Graphs and Combinatorics, 2010, 26 : 721 - 726
[3] k-路形式的K?nig-Egerváry图
张志鹏
涂建华
北京化工大学学报(自然科学版), 2019, 46 (06) : 108 - 111
[4] Critical Independent Sets and König–Egerváry Graphs
Vadim E. Levit
Eugen Mandrescu
Graphs and Combinatorics, 2012, 28 : 243 - 250
[5] When is G2 a König–Egerváry Graph?
Vadim E. Levit
Eugen Mandrescu
Graphs and Combinatorics, 2013, 29 : 1453 - 1458
[6] Some good characterization results relating to the Kőnig–Egerváry theorem
Mihály Hujter
Central European Journal of Operations Research, 2010, 18 : 37 - 45
[7] Jacobi’s Bound: Jacobi’s results translated in Kőnig’s, Egerváry’s and Ritt’s mathematical languages
François Ollivier
Applicable Algebra in Engineering, Communication and Computing, 2023, 34 : 793 - 885
[8] Jacobi's Bound. Jacobi's results translated in K{Ö}nig's, Egerv{á}ry's and Ritt's mathematical languages
Ollivier, François
arXiv, 2021,
[9] Non-Bipartite K-Common Graphs
Daniel Král’
Jonathan A. Noel
Sergey Norin
Jan Volec
Fan Wei
Combinatorica, 2022, 42 : 87 - 114
[10] Non-Bipartite K-Common Graphs
Kral, Daniel
Noel, Jonathan A.
Norin, Sergey
Volec, Jan
Wei, Fan
COMBINATORICA, 2022, 42 (01) : 87 - 114

← 1 2 →