Separating path systems in trees

DOI10.1007/S10957-025-02894-ZMaRDI QIDQ6874618zbMATH OpenFDO

Authors Francisco Arrepol, Patricio Asenjo, Raúl Astete, Víctor Cartes, Anahí Gajardo, Valeria Henríquez, Catalina Opazo, Nicolás Sanhueza-Matamala, Christopher Thraves Caro

Publication date 15 January 2026

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-025-02894-Z

zbMATH Keywords

identifying familiesseparating familiesseparating path systemstrees

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Cites work

• Approximation algorithms for the test cover problem
• Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
• scientific article; zbMATH DE number 3161569 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Identifying path covers in graphs
• On the identification of vertices using cycles
• On the path separation number of graphs
• Random graph's Hamiltonicity is strongly tied to its minimum degree
• Separating path systems
• Separating path systems for the complete graph
• Separating path systems of almost linear size
• Separating the edges of a graph by a linear number of paths

Cited in

(1)

• Vertex-separating path systems in random graphs

This page was built for publication: Separating path systems in trees

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