Covering the edges of a graph with triangles

DOI10.1016/J.DISC.2024.114226MaRDI QIDQ6635092

A. Davoodi, Ervin Győri, Csilla Bujtás, Donglei Yang, Lai-hao Ding, Zsolt Tuza

Publication date: 9 November 2024

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

zbMATH Keywords

edge clique coveringedge-disjoint trianglesNordhaus-Gaddum inequality

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Pairwise balanced designs and sigma clique partitions
• Triangle-free partial graphs and edge covering theorems
• Some recent problems and results in graph theory
• Extremal clique coverings of complementary graphs
• Covering and independence in triangle structures
• A survey of Nordhaus-Gaddum type relations
• Clique coverings and claw-free graphs
• On a Conjecture of Erdős, Gallai, and Tuza
• On Complementary Graphs

This page was built for publication: Covering the edges of a graph with triangles

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