The Complexity of Coloring Circular Arcs and Chords (Q3964622): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55951939, #quickstatements; #temporary_batch_1707252663060 |
Created claim: DBLP publication ID (P1635): journals/siammax/GareyJMP80, #quickstatements; #temporary_batch_1731468600454 |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: David S. Johnson / rank | |||
Property / author | |||
Property / author: Gary Lee Miller / rank | |||
Property / author | |||
Property / author: Q197784 / rank | |||
Property / author | |||
Property / author: David S. Johnson / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Gary Lee Miller / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Christos H. Papadimitriou / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/0601025 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2074937107 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5684962 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for a maximum clique and a maximum independent set of a circle graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms on circular-arc graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4057549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix characterizations of circular-arc graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Structure theorems for some circular-arc graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring a Family of Circular Arcs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Test for Circular-Arc Graphs / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/siammax/GareyJMP80 / rank | |||
Normal rank |
Latest revision as of 05:13, 13 November 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Complexity of Coloring Circular Arcs and Chords |
scientific article |
Statements
The Complexity of Coloring Circular Arcs and Chords (English)
0 references
1980
0 references
word problem
0 references
circular arc graph coloring problem
0 references
circle graph coloring problem
0 references
NP-complete
0 references