scientific article; zbMATH DE number 5238980
From MaRDI portal
Publication:5442366
zbMath1143.05043MaRDI QIDQ5442366
Tomislav Došlić, Damir Vukičević
Publication date: 22 February 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (15)
The anti-Kekulé number of graphs ⋮ Complete forcing numbers of hexagonal systems. II ⋮ Complete forcing numbers of primitive coronoids ⋮ Complete forcing numbers of complete and almost-complete multipartite graphs ⋮ Global forcing number for maximal matchings ⋮ On the anti-Kekulé number of (4, 5, 6)-fullerenes ⋮ On forcing matching number of boron-nitrogen fullerene graphs ⋮ Unnamed Item ⋮ The global forcing number of the parallelogram polyhex ⋮ On the anti-Kekulé problem of cubic graphs ⋮ On the global forcing number of hexagonal systems ⋮ Complete forcing numbers of hexagonal systems ⋮ Relations between global forcing number and maximum anti-forcing number of a graph ⋮ Complete forcing numbers of catacondensed hexagonal systems ⋮ Complete forcing numbers of graphs
This page was built for publication:
