Achromatic number of fragmentable graphs (Q3055929): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Achromatic number is NP-complete for cographs and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The achromatic number of bounded degree trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Achromatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detachments of Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on harmonious colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concerning the achromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximating the Achromatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation of the Achromatic Number on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation algorithms for the achromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The achromatic number of the union of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The achromatic number of the union of paths / rank
 
Normal rank

Revision as of 10:38, 3 July 2024

scientific article
Language Label Description Also known as
English
Achromatic number of fragmentable graphs
scientific article

    Statements

    Achromatic number of fragmentable graphs (English)
    0 references
    0 references
    10 November 2010
    0 references
    complete coloring
    0 references
    proper vertex coloring
    0 references
    achromatic number
    0 references
    detachment
    0 references
    fragmentable graph
    0 references

    Identifiers