On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting

被引：0

作者：

Firbas, Alexander ^{[1
]}

Sorge, Manuel ^{[1
]}

机构：

[1] TU Wien, Austria

来源：

Leibniz International Proceedings in Informatics, LIPIcs | / 322卷

关键词：

Graphitization - Integrated circuit design - NP-hard - Polynomial approximation;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[31] Parameterized complexity of finding subgraphs with hereditary properties
Khot, S
Raman, V
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 137 - 147
[32] Parameterized complexity of finding subgraphs with hereditary properties
Khot, S
Raman, V
THEORETICAL COMPUTER SCIENCE, 2002, 289 (02) : 997 - 1008
[33] Efficient Solvability of the Weighted Vertex Coloring Problem for Some Two Hereditary Graph Classes
Razvenskaya O.O.
Malyshev D.S.
Journal of Applied and Industrial Mathematics, 2021, 15 (01) : 97 - 117
[34] A jump to the bell number for hereditary graph properties
Balogh, J
Bollobás, B
Weinreich, D
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 95 (01) : 29 - 48
[35] Unique Factorization of Compositive Hereditary Graph Properties
Izak BROERE
Ewa DRGAS-BURCHARDT
Acta Mathematica Sinica,English Series, 2012, (02) : 267 - 280
[36] Unique factorization of compositive hereditary graph properties
Broere, Izak
Drgas-Burchardt, Ewa
ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2012, 28 (02) : 267 - 280
[37] DECIDING THE BELL NUMBER FOR HEREDITARY GRAPH PROPERTIES
Atminas, Aistis
Collins, Andrew
Foniok, Jan
Lozin, Vadim V.
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (02) : 1015 - 1031
[38] UNIVERSALITY FOR AND IN INDUCED-HEREDITARY GRAPH PROPERTIES
Broere, Izak
Heidema, Johannes
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2013, 33 (01) : 33 - 47
[39] Unique factorization of compositive hereditary graph properties
Izak Broere
Ewa Drgas-Burchardt
Acta Mathematica Sinica, English Series, 2012, 28 : 267 - 280
[40] CONDITIONAL GRAPH CONNECTIVITY RELATIVE TO HEREDITARY PROPERTIES
OELLERMANN, OR
NETWORKS, 1991, 21 (02) : 245 - 255

← 1 2 3 4 5 →