Edge-chromatic numbers of Mycielski graphs (Q409467): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Circular chromatic numbers of Mycielski's graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number and Mycielski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Méthode et théorème général de coloration des aretes d'un multigraphe / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fractional chromatic number of mycielski's graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number for iterated Mycielski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs of maximum degree seven are Class I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional chromatic numbers of cones over graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph with maximum degree 7 is of class 1 / rank
 
Normal rank

Latest revision as of 02:23, 5 July 2024

scientific article
Language Label Description Also known as
English
Edge-chromatic numbers of Mycielski graphs
scientific article

    Statements

    Identifiers