Weighted well-covered graphs without cycles of lengths 5, 6 and 7

被引：0

|

作者：

Tankus, David ^{[1
]}

机构：

[1] Department of Software Engineering, Sami Shamoon College of Engineering, Israel

来源：

Information Processing Letters | 2022年 / 174卷

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

19

引用

收藏

相关论文

共 50 条

[1] Weighted well-covered graphs without cycles of lengths 5, 6 and 7
Tankus, David
INFORMATION PROCESSING LETTERS, 2022, 174
[2] Well-covered graphs without cycles of lengths 4, 5 and 6
Levit, Vadim E.
Tankus, David
DISCRETE APPLIED MATHEMATICS, 2015, 186 : 158 - 167
[3] On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6
Levit, Vadim E.
Tankus, David
GRAPH THEORY, COMPUTATIONAL INTELLIGENCE AND THOUGHT, 2009, 5420 : 144 - 147
[4] NONPLANAR GRAPHS AND WELL-COVERED CYCLES
RICHTER, RB
DISCRETE MATHEMATICS, 1990, 85 (02) : 221 - 222
[5] On the local structure of well-covered graphs without 4-cycles
Hartnell, BL
ARS COMBINATORIA, 1997, 45 : 77 - 86
[6] Weighted well-covered graphs without C4, C5, C6, C7
Levit, Vadim E.
Tankus, David
DISCRETE APPLIED MATHEMATICS, 2011, 159 (05) : 354 - 359
[7] WEIGHTED WELL-COVERED GRAPHS AND COMPLEXITY QUESTIONS
Zverovich, Igor E.
MOSCOW MATHEMATICAL JOURNAL, 2004, 4 (02) : 523 - 528
[8] The structure of well-covered graphs with no cycles of length 4
Brown, J. I.
Nowakowski, R. J.
Zverovich, I. E.
DISCRETE MATHEMATICS, 2007, 307 (17-18) : 2235 - 2245
[9] Weighted well-covered claw-free graphs
Levit, Vadim E.
Tankus, David
DISCRETE MATHEMATICS, 2015, 338 (03) : 99 - 106
[10] STRONGLY WELL-COVERED GRAPHS
PINTER, MR
DISCRETE MATHEMATICS, 1994, 132 (1-3) : 231 - 246

← 1 2 3 4 5 →