Existence of connected intersection-free subgraphs in graphs with redundancy and coexistence property

DOI10.1007/978-3-030-34405-4_4MaRDI QIDQ6536155zbMATH OpenFDO

Authors Lucas Böltz, Hannes Frey

Publication date 5 April 2024

Full work available at URL https://doi.org/10.1007/978-3-030-34405-4_4

zbMATH Keywords

coexistence propertyconnected subgraphintersection-free subgraphredundancy property

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Mobile wireless sensor network connectivity repair with k-redundancy
• Graphs with given connectivity properties
• Connectivity of the uniform random intersection graph
• SOFSEM 2006: Theory and Practice of Computer Science

Cites work

• Routing with guaranteed delivery in ad hoc wireless networks

This page was built for publication: Existence of connected intersection-free subgraphs in graphs with redundancy and coexistence property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536155)