Geodesic packing in graphs
From MaRDI portal
Publication:6095044
DOI10.1016/j.amc.2023.128277arXiv2210.15325OpenAlexW4385962665MaRDI QIDQ6095044
Paul D. Manuel, Sandi Klavžar, Boštjan Brešar
Publication date: 11 October 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.15325
Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing paths perfectly
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- Davenport-Schinzel theory of matrices
- On the mutual visibility in Cartesian products and triangle-free graphs
- The geodesic-transversal problem
- Extension of Vertex Cover and Independent Set in some classes of graphs
- The path partition problem and related problems in bipartite graphs
- Edge-disjoint packing of stars and cycles
- Mutual visibility in graphs
- On the Line Graph of the Complete Bipartite Graph
- The complexity of packing edge-disjoint paths
This page was built for publication: Geodesic packing in graphs
