A property about minimum edge- and minimum clique-cover of a graph
From MaRDI portal
Publication:5952389
DOI10.1007/PL00013414zbMath1010.05065MaRDI QIDQ5952389
Publication date: 11 May 2003
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
This page was built for publication: A property about minimum edge- and minimum clique-cover of a graph