Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs

DOI10.1016/j.dam.2018.08.014zbMath1405.05186OpenAlexW2897096867WikidataQ129101504 ScholiaQ129101504MaRDI QIDQ1727753

Andrzej Żak

Publication date: 20 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.08.014

zbMATH Keywords

transversalvertex cover\(H\)-independencenode fault tolerance

Mathematics Subject Classification ID

Hypergraphs (05C65) Transversal (matching) theory (05D15)

Related Items

The k‐path vertex cover: General bounds and chordal graphs ⋮ The geodesic-transversal problem

Cites Work

• Unnamed Item
• Unnamed Item
• On \((K_q,k)\) vertex stable graphs with minimum size
• On \((C_n;k)\) stable graphs
• A generalization of an independent set with application to \((K_q; k)\)-stable graphs
• Explicit construction of linear sized tolerant networks
• Covering all cliques of a graph
• Designing fault-tolerant systems using automorphisms
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• Transversal numbers of uniform hypergraphs
• New approach to the \(k\)-independence number of a graph
• Minimum \(k\)-path vertex cover
• On (Kq;k)-Stable Graphs
• (H,k) stable graphs with minimum size
• On F-independence in graphs
• Designing optimal fault-tolerant star networks
• A Graph Model for Fault-Tolerant Computing Systems
• On Minimum Fault-Tolerant Networks
• Fault-Tolerant Meshes with Small Degree
• Fault-tolerant meshes with small degree

This page was built for publication: Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs