Packing triangles in a graph and its complement
From MaRDI portal
Recommendations
Cited in
(18)- Triangle packings and 1-factors in oriented graphs
- Packing and covering triangles in graphs
- On the number of edges not covered by monochromatic copies of a fixed graph.
- Number of triangular packings of a marked graph on a projective plane
- The number of edge-disjoint transitive triples in a tournament
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- Regarding two conjectures on clique and biclique partitions
- Clique coverings and claw-free graphs
- Packing triangles in regular tournaments
- scientific article; zbMATH DE number 4089569 (Why is no real title available?)
- scientific article; zbMATH DE number 1275586 (Why is no real title available?)
- scientific article; zbMATH DE number 1760745 (Why is no real title available?)
- Many disjoint triangles in co-triangle-free graphs
- On edges not in monochromatic copies of a fixed bipartite graph
- Packing Cliques in Graphs with Independence Number 2
- On tournament inversion
- The number of triangular packings of a vertex labelled graph on a torus
- Packing and covering triangles in planar graphs
This page was built for publication: Packing triangles in a graph and its complement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159377)