Zobrazeno 1 - 10
of 10
pro vyhledávání: '"05C69 (Primary) 05C85 (Secondary)"'
Autor:
Levit, Vadim E., Tankus, David
A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight. For every
Externí odkaz:
http://arxiv.org/abs/1811.04433
Autor:
Levit, Vadim E., Tankus, David
A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight. For every
Externí odkaz:
http://arxiv.org/abs/1811.04429
Autor:
Dvořák, Zdeněk, Venters, Jordan
Since planar triangle-free graphs are 3-colourable, such a graph with n vertices has an independent set of size at least n/3. We prove that unless the graph contains a certain obstruction, its independence number is at least n/(3-epsilon) for some fi
Externí odkaz:
http://arxiv.org/abs/1702.02888
Autor:
Levit, Vadim E., Tankus, David
Let $G$ be a graph. A set $S$ of vertices in $G$ dominates the graph if every vertex of $G$ is either in $S$ or a neighbor of a vertex in $S$. Finding a minimal cardinality set which dominates the graph is an NP-complete problem. The graph $G$ is wel
Externí odkaz:
http://arxiv.org/abs/1409.1466
Autor:
Levit, Vadim E., Tankus, David
A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For every graph G,
Externí odkaz:
http://arxiv.org/abs/1401.0294
Autor:
Levit, Vadim E., Tankus, David
A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For every graph G,
Externí odkaz:
http://arxiv.org/abs/1312.7563
Autor:
Levit, Vadim, Tankus, David
A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For every graph G,
Externí odkaz:
http://arxiv.org/abs/1210.6918
Autor:
David Tankus, Vadim E. Levit
Publikováno v:
International Journal of Foundations of Computer Science. 32:93-114
A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight. For every
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5342c38ecd9b4a20996cfe2bd61422ed
https://doi.org/10.1142/s0129054121500052
https://doi.org/10.1142/s0129054121500052
Autor:
Vadim E. Levit, David Tankus
Publikováno v:
Algorithmica. 80:2384-2399
A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For every graph G,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc2787c74ae24015cbe780ecef37288b
https://doi.org/10.1007/s00453-017-0325-1
https://doi.org/10.1007/s00453-017-0325-1
Autor:
Vadim E. Levit, David Tankus
A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For every graph G,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b131feafd62417e5fe909dbbe57b4eb