
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexity, Analysis of algorithms and problem complexity, 511, Forbidden subgraphs., Complexity, algorithms, Graph coloring, 004, forbidden subgraphs, Coloring of graphs and hypergraphs, Inteligence artificielle, Graph algorithms (graph-theoretic aspects), Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), graph coloring, Forbidden subgraphs, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 006.3, Algorithms
computational complexity, Analysis of algorithms and problem complexity, 511, Forbidden subgraphs., Complexity, algorithms, Graph coloring, 004, forbidden subgraphs, Coloring of graphs and hypergraphs, Inteligence artificielle, Graph algorithms (graph-theoretic aspects), Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), graph coloring, Forbidden subgraphs, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 006.3, Algorithms
| 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). | 15 | |
| 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. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
