A polynomial time algorithm for strong edge coloring of partial k-trees
Copyright policy )A polynomial time algorithm for strong edge coloring of partial k-trees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applied Mathematics, Coloring of graphs and hypergraphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Bounded tree-width, Discrete Mathematics and Combinatorics, Strong matching, Strong edge coloring, Edge coloring
Applied Mathematics, Coloring of graphs and hypergraphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Bounded tree-width, Discrete Mathematics and Combinatorics, Strong matching, Strong edge coloring, Edge coloring
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).17 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).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!