Well-Covered Claw-Free Graphs
Copyright policy )Well-Covered Claw-Free Graphs
The existence of a polynomial algorithm, to tell whether a claw-free graph is well covered, is proved.
- Tel Aviv University Israel
Coloring of graphs and hypergraphs, claw-free graph, Computational Theory and Mathematics, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), Discrete Mathematics and Combinatorics, polynomial algorithm, Theoretical Computer Science
Coloring of graphs and hypergraphs, claw-free graph, Computational Theory and Mathematics, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), Discrete Mathematics and Combinatorics, polynomial algorithm, Theoretical Computer Science
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).37 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.Top 10%
Citations provided by BIP!Popularity provided by BIP!