Achromatic number of collections of paths and cycles (Q383738): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Packing Circuits into <i>K</i><sub><i>N</i></sub> / rank
 
Normal rank
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: Q4352945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detachments of Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achromatic number of fragmentable graphs / 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: 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

Latest revision as of 03:53, 7 July 2024

scientific article
Language Label Description Also known as
English
Achromatic number of collections of paths and cycles
scientific article

    Statements