General lower bound on the size of $$(H;k)$$ -stable graphs
Work
Year: 2013
Type: article
Abstract: A graph $$G$$ is called $$(H;k)$$ -vertex stable if $$G$$ contains a subgraph isomorphic to $$H$$ ever after removing any $$k$$ of its vertices. By stab $$(H;k)$$ we denote the minimum size among the ... more
Author Andrzej Żak
Institution AGH University of Krakow
Cites: 13
Cited by: 5
Related to: 10
FWCI: 0.571
Citation percentile (by year/subfield): 65.38
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,990