Packing and Covering a Given Directed Graph in a Directed Graph

DOI10.1137/22m1534134arXiv2312.01901OpenAlexW4390585045MaRDI QIDQ6146269

Raphael Yuster

Publication date: 10 January 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

coveringcycleapproximationpacking

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Packing directed cycles efficiently
• Integer and fractional packings in dense graphs
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Packing and covering triangles in graphs
• On pancyclic digraphs
• On a conjecture of Tuza about packing and covering of triangles
• Packing and covering directed triangles asymptotically
• Packing and covering directed triangles
• A conjecture on triangles of graphs
• Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing
• Constructive Quasi-Ramsey Numbers and Tournament Ranking
• Integer and fractional packing of families of graphs
• Tuza's Conjecture is Asymptotically Tight for Dense Graphs
• Node-and edge-deletion NP-complete problems
• Approximating Maximum Subgraphs without Short Cycles
• Testing subgraphs in directed graphs

This page was built for publication: Packing and Covering a Given Directed Graph in a Directed Graph