On minimum (K_q,k) stable graphs
Work
Year: 2012
Type: article
Abstract: A graph G is a (Kq, k) stable graph (q ≥ 3) if it contains a Kq after deleting any subset of k vertices (k ≥ 0).In the paper "On (Kq; k)-stable graphs", (http://onlinelibrary.wiley.com/doi/10.1002/jgt... more
Institutions Laboratoire d'Informatique Fondamentale d'Orléans, Laboratoire d’Informatique Fondamentale de Marseille, AGH University of Krakow
Cites: 8
Cited by: 1
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond