Complete multipartite graphs and the relaxed coloring game (Q1757865): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987099235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Map-Coloring Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed game chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound for the game chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple competitive graph coloring algorithm. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple competitive graph coloring algorithm. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relaxed game chromatic number of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4201568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed game chromatic number of trees and outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple competitive graph coloring algorithm / rank
 
Normal rank

Latest revision as of 21:01, 5 July 2024

scientific article
Language Label Description Also known as
English
Complete multipartite graphs and the relaxed coloring game
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references