On the path separation number of graphs

DOI10.1016/J.DAM.2016.05.022zbMath1344.05078arXiv1312.1724OpenAlexW2964084646MaRDI QIDQ313786

Béla Csaba, Ryan R. Martin, József Balogh, András Pluhár

Publication date: 12 September 2016

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

Full work available at URL: https://arxiv.org/abs/1312.1724

zbMATH Keywords

treesnetwork reliabilitytest setspath decompositionpath coveringpath separation

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (1)

Separating path systems for the complete graph

Cites Work

• Identifying path covers in graphs
• Separating path systems
• On separating systems
• Hamiltonian circuits in random graphs
• Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
• Perfect matchings extend to Hamilton cycles in hypercubes
• Extremal Combinatorics
• Clutter percolation and random graphs
• Identifying Codes in Line Graphs
• On a problem concerning separating systems of a finite set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the path separation number of graphs