Triangle-free partial graphs and edge covering theorems

DOI10.1016/0012-365X(82)90040-1zbMath0499.05026MaRDI QIDQ1171575

Jenő Lehel, Zsolt Tuza

Publication date: 1982

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

zbMATH Keywords

colorable partial graphedge covering numbers

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Covering and independence in triangle structures ⋮ Maximum bipartite subgraphs of Kneser graphs ⋮ Bisections of graphs ⋮ A conjecture on triangles of graphs ⋮ Maximum directed cuts in digraphs with degree restriction ⋮ Covering a graph by topological complete subgraphs ⋮ Bipartite subgraphs ⋮ Covers in hypergraphs ⋮ Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality ⋮ Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices

Cites Work

• Unnamed Item
• Unnamed Item
• On Representatives of Subsets
• The Representation of a Graph by Set Intersections

This page was built for publication: Triangle-free partial graphs and edge covering theorems