Packing and Covering a Given Directed Graph in a Directed Graph
From MaRDI portal
Recommendations
Cites work
- A conjecture on triangles of graphs
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Approximating maximum subgraphs without short cycles
- Constructive Quasi-Ramsey Numbers and Tournament Ranking
- Dense graphs with a large triangle cover have a large triangle packing
- scientific article; zbMATH DE number 3333210 (Why is no real title available?)
- Integer and fractional packing of families of graphs
- Integer and fractional packings in dense graphs
- Node-and edge-deletion NP-complete problems
- On a conjecture of Tuza about packing and covering of triangles
- On pancyclic digraphs
- Packing and covering directed triangles
- Packing and covering directed triangles asymptotically
- Packing and covering triangles in graphs
- Packing directed cycles efficiently
- Testing subgraphs in directed graphs
- The probabilistic method
- Tuza's conjecture is asymptotically tight for dense graphs
This page was built for publication: Packing and Covering a Given Directed Graph in a Directed Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146269)