On the path separation number of graphs
Authors:
- József BaloghJBJózsef Balogh
- Béla CsabaBCBéla Csaba
- Ryan R. MartinRMRyan R. Martin
- András PluhárAPAndrás Pluhár
- 1 November 2016
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 213, 26-33
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- NSF CAREER (DMS-0745185, TÁMOP-4.2.1/B-09/1/KONV-2010-0005)
- Marie Curie FP7-PEOPLE-2012-IIF (327763)
- European Union
- European Social Fund Plus (TAMOP-4.2.2.C-11/1/KONV-2012-0013)
- ERC-AdG (321104)
- NSF (DMS-0901008)
- NSA (H98230-13-1-0226)
This publication has 10 references indexed in Scilit:
- Identifying path covers in graphsJournal of Discrete Algorithms, 2013
- Identifying Codes in Line GraphsJournal of Graph Theory, 2012
- On Monitoring and Failure Localization in Mesh All-Optical Networks2009
- Perfect matchings extend to Hamilton cycles in hypercubesJournal of Combinatorial Theory, Series B, 2007
- On separating systemsEuropean Journal of Combinatorics, 2007
- Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs2007
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional toriDiscrete Applied Mathematics, 2003
- Clutter percolation and random graphs1980
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976
- On a problem concerning separating systems of a finite setJournal of Combinatorial Theory, 1969