Separating Path Systems in Complete Graphs
- 6 March 2024
- book chapter
- Published by Springer Nature
- p. 98-113
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Separating path systems of almost linear sizeTransactions of the American Mathematical Society, 2024
- Separating path systems in complete graphsarXiv, 2023
- Separating path systems for the complete graphDiscrete Mathematics, 2023
- Separating the edges of a graph by a linear number of pathsAdvances in Combinatorics, 2023
- Conflict-free hypergraph matchings2023
- On the path separation number of graphsDiscrete Applied Mathematics, 2016
- Hamilton decompositions of regular expanders: ApplicationsJournal of Combinatorial Theory, Series B, 2014
- On Orthogonal Double Covers of GraphsDesigns, Codes and Cryptography, 2002
- Fault-tolerant message routing for multiprocessorsLecture Notes in Computer Science, 1998
- Self-orthogonal Hamilton path decompositionsDiscrete Mathematics, 1991