The Complexity of Coloring Circular Arcs and Chords (Q3964622): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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

Latest revision as of 17:26, 13 June 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
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    word problem
    0 references
    circular arc graph coloring problem
    0 references
    circle graph coloring problem
    0 references
    NP-complete
    0 references
    0 references
    0 references