Minimizing the number of complete bipartite graphs in a $K_s$-saturated graph

From MaRDI portal
Revision as of 09:04, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6357442
Powered by MediaWiki