
doi: 10.1007/bf02883068
Summary: Let \(G\) be a graph and let \(a\), \(b\) be nonegative integers with \(a\leq b\). Then graph \(G\) is called an \((a, b, k)\)-critical graph if after deleting any \(k\) vertices of \(G\) the remaining graph of \(G\) has an \([a, b]\)-factor. In this paper a necessary and sufficient condition for a graph to be \((a, b, k)\)-critical is given. Some applications of this condition are discussed. Therefore the properties of \((a, b, k)\)-critical graph are studied.
\([a,b]\)-factors, \([a, b]\)-factor, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), critical graphs, matchings, degree constrained subgraphs, \((a, b, k)\)-critical graph
\([a,b]\)-factors, \([a, b]\)-factor, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), critical graphs, matchings, degree constrained subgraphs, \((a, b, k)\)-critical graph
| 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 |
