Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Separating path systems

From MaRDI portal
Publication:482277
Jump to:navigation, search

DOI10.4310/JOC.2014.v5.n3.a4zbMath1305.05108arXiv1311.5051OpenAlexW2963185277MaRDI QIDQ482277

Shoham Letzter, Bhargav P. Narayanan, Teeradej Kittipassorn, Dániel Korándi, Victor Falgas-Ravry

Publication date: 22 December 2014

Published in: Journal of Combinatorics (Search for Journal in Brave)

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


zbMATH Keywords

minimal separating path system


Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Vertex degrees (05C07)


Related Items

On the path separation number of graphs ⋮ Separating path systems for the complete graph



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:482277&oldid=12362750"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 05:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki