
doi: 10.2139/ssrn.4670199
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), conditional \(k\)-matching preclusion, \(k\)-matching preclusion, Enumeration in graph theory, fractional matching preclusion, tours networks, matching preclusion
Extremal problems in graph theory, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), conditional \(k\)-matching preclusion, \(k\)-matching preclusion, Enumeration in graph theory, fractional matching preclusion, tours networks, matching preclusion
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
