On the minimum and maximum selective graph coloring problems in some graph classes (Q266810): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Perfectness of clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graph recognition is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. VII. Quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the selective graph coloring problem in some special classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some applications of the selective graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of path coloring and call scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for partition coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coloring unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price approach for the partition coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and wavelength assignment by partition colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank

Revision as of 17:51, 11 July 2024

scientific article
Language Label Description Also known as
English
On the minimum and maximum selective graph coloring problems in some graph classes
scientific article

    Statements

    Identifiers