Packing and covering triangles in bilaterally-complete tripartite graphs

DOI10.1007/S00373-024-02845-XMaRDI QIDQ6640953

Naivedya Amarnani, Amaury De Burgos, Wayne J. Broughton

Publication date: 20 November 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

complete bipartite graphtrianglesmaximum packingtripartite graphsminimum T-transversal

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Packing and covering triangles in tripartite graphs
• Zur allgemeinen Kurventheorie.
• Graphok és alkalmazásuk a determinánsok és a halmazok elméletére. (Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.).
• Small edge sets meeting all triangles of a graph
• Applications of Menger's graph theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Packing and covering triangles in bilaterally-complete tripartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640953)