The Complexity of Coloring Circular Arcs and Chords
Copyright policy )The Complexity of Coloring Circular Arcs and Chords
The word problem for products of symmetric groups, the circular arc graph coloring problem, and the circle graph coloring problem, as well as several related problems, are proved to be $NP$-complete. For any fixed number K of colors, the problem of determining whether a given circular arc graph is K-colorable is shown to be solvable in polynomial time.
Graph theory, word problem, Coloring of graphs and hypergraphs, circular arc graph coloring problem, Analysis of algorithms and problem complexity, circle graph coloring problem, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), NP-complete
Graph theory, word problem, Coloring of graphs and hypergraphs, circular arc graph coloring problem, Analysis of algorithms and problem complexity, circle graph coloring problem, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), NP-complete
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).269 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 1% 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 0.1% 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!