The game \(L(d,1)\)-labeling problem of graphs (Q456896): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2012.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W50257190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on 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: Q4201568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game chromatic number of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple competitive graph coloring algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius two trees specify χ‐bounded classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game coloring number of planar graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:18, 5 July 2024

scientific article
Language Label Description Also known as
English
The game \(L(d,1)\)-labeling problem of graphs
scientific article

    Statements

    The game \(L(d,1)\)-labeling problem of graphs (English)
    0 references
    0 references
    0 references
    16 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    game \(L(d,1)\)-labeling
    0 references
    complete graphs
    0 references
    complete bipartite graphs
    0 references
    0 references