Covering triangles in edge-weighted graphs
type: Item
instance of: scholarly article
title: Covering triangles in edge-weighted graphs
zbMATH Open document ID: 1396.05090
author: Zhuo Diao
author: Zhongzheng Tang
author: Xujin Chen
author: Xiaodong Hu
published in: Theory of Computing Systems
publication date: 2018-08-03T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6912870
zbMATH Keywords: triangle cover
zbMATH Keywords: triangle packing
zbMATH Keywords: linear 3-uniform hypergraphs
zbMATH Keywords: combinatorial algorithms
MaRDI profile type: Publication
full work available at URL: s00224-018-9860-7
OpenAlex ID: W2793477091
cites work: Packing Triangles in Weighted Graphs
cites work: Packing and covering triangles in graphs
cites work: A conjecture on triangles of graphs
cites work: On a conjecture of Tuza about packing and covering of triangles
cites work: Packing and covering triangles in tripartite graphs
cites work: Packing and covering triangles in \(K_{4}\)-free planar graphs
cites work: Packing and covering triangles in planar graphs
cites work: Tuza's Conjecture is Asymptotically Tight for Dense Graphs
cites work: Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
cites work: On a Class of Totally Unimodular Matrices
cites work: Q3993087
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: The probabilistic method
cites work: Q4226075
Wikidata QID: Q130062059
DOI: 10.1007/S00224-018-9860-7
description: scientific article; zbMATH DE number 6912870