On separating path and tree systems in graphs

DOI10.46298/DMTCS.12743MaRDI QIDQ6876003zbMATH OpenFDO

Authors Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky

Publication date 13 January 2026

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.12743

zbMATH Keywords

separating set systemvertex-separating path systemvertex-separating tree system

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A combinatorial problem; stability and order for models and theories in infinitary languages
• Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
• Das Geschlecht des vollständigen paaren Graphen
• Density and dimension
• Der vollständige paare Graph auf nichtorientierbaren Flächen.
• Graph theory
• scientific article; zbMATH DE number 3161569 (Why is no real title available?)
• scientific article; zbMATH DE number 1749054 (Why is no real title available?)
• Identification of points using disks
• Identifying path covers in graphs
• Minimal completely separating systems of \(k\)-sets
• On separating systems
• On separating systems of a finite set
• On separating systems of graphs
• On separating systems whose elements are sets of at most k elements
• On separating systems with bounded set size
• On the density of families of sets
• On the identification of vertices using cycles
• On the path separation number of graphs
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Orientable and non orientable genus of the complete bipartite graph
• Quasi-optimal range searching in spaces of finite VC-dimension
• Separating families of convex sets
• Separating path systems
• Separating the edges of a graph by a linear number of paths
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension

Cited in

(1)

• Vertex-separating path systems in random graphs

This page was built for publication: On separating path and tree systems in graphs

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