Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
COCOON
/
Paper
On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques.
Ioan Tomescu
Venue
National
COCOON
Year
2002
Proceedings
COCOON
DBLP record
conf/cocoon/Tomescu02 ↗
Browse the full
COCOON paper archive
.