Publication:4664109
From MaRDI portal
zbMath1063.05074MaRDI QIDQ4664109
Jelena Sedlar, Damir Vukičević
Publication date: 5 April 2005
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Complete forcing numbers of graphs, Complete forcing numbers of complete and almost-complete multipartite graphs, Complete forcing numbers of primitive coronoids, On forcing matching number of boron-nitrogen fullerene graphs, The global forcing number of the parallelogram polyhex, On the global forcing number of hexagonal systems, Global forcing number for maximal matchings, Complete forcing numbers of hexagonal systems, Relations between global forcing number and maximum anti-forcing number of a graph, Complete forcing numbers of hexagonal systems. II, Complete forcing numbers of catacondensed hexagonal systems, On the anti-forcing number of benzenoids