Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
type: Item
instance of: scholarly article
title: Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
zbMATH Open document ID: 1405.05186
author: Andrzej Żak
published in: Discrete Applied Mathematics
publication date: 2019-02-20T00:00:00Z
Mathematics Subject Classification ID: 05D15
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 7027144
zbMATH Keywords: transversal
zbMATH Keywords: vertex cover
zbMATH Keywords: node fault tolerance
zbMATH Keywords: \(H\)-independence
MaRDI profile type: Publication
full work available at URL: j.dam.2018.08.014
OpenAlex ID: W2897096867
cites work: Q4228444
cites work: Transversal numbers of uniform hypergraphs
cites work: Explicit construction of linear sized tolerant networks
cites work: Minimum \(k\)-path vertex cover
cites work: Fault-Tolerant Meshes with Small Degree
cites work: New approach to the \(k\)-independence number of a graph
cites work: On \((C_n;k)\) stable graphs
cites work: (H,k) stable graphs with minimum size
cites work: Designing fault-tolerant systems using automorphisms
cites work: Designing optimal fault-tolerant star networks
cites work: On \((K_q,k)\) vertex stable graphs with minimum size
cites work: On F-independence in graphs
cites work: A Graph Model for Fault-Tolerant Computing Systems
cites work: Q4726281
cites work: An upper bound for the transversal numbers of 4-uniform hypergraphs
cites work: Covering all cliques of a graph
cites work: On Minimum Fault-Tolerant Networks
cites work: On (\(K_q;k\))-stable graphs
cites work: A generalization of an independent set with application to \((K_q; k)\)-stable graphs
cites work: Fault-tolerant meshes with small degree
Wikidata QID: Q129101504
DOI: 10.1016/J.DAM.2018.08.014
description: scientific article; zbMATH DE number 7027144