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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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

    Complete multipartite graphs and the relaxed coloring game (English)
    0 references
    0 references
    0 references
    7 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    competitive coloring
    0 references
    relaxed coloring
    0 references
    multipartite graphs
    0 references
    0 references