Triangle-free partial graphs and edge covering theorems

DOI10.1016/0012-365X(82)90040-1MaRDI QIDQ1171575zbMATH OpenFDO

Authors Jeno Lehel, Zsolt Tuza

Publication date 1982

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(82)90040-1

zbMATH Keywords

colorable partial graphedge covering numbers

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• On Representatives of Subsets
• The Representation of a Graph by Set Intersections

Cited in

(11)

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

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

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