The game L(d,1)-labeling problem of graphs

DOI10.1016/J.DISC.2012.07.002zbMATH Open1251.05105OpenAlexW50257190MaRDI QIDQ456896FDOQ456896

Authors: Ma-Lian Chia, Huei-Ni Hsu, David Kuo, Sheng-Chyang Liaw, Zi-Teng Xu 

Publication date: 16 October 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.07.002

Recommendations

• A simple competitive graph coloring algorithm. III
• A simple competitive graph coloring algorithm. II.
• On \(L(d,1)\)-labelings of graphs
• Game list colouring of graphs
• scientific article; zbMATH DE number 2145257

zbMATH Keywords

complete graphscomplete bipartite graphsgame \(L(d,1)\)-labeling

Mathematics Subject Classification ID

2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Labelling Graphs with a Condition at Distance 2
• A bound for the game chromatic number of graphs
• A survey on labeling graphs with a condition at distance two
• Title not available (Why is that?)
• Game chromatic number of outerplanar graphs
• The $L(2,1)$-Labeling Problem on Graphs
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm
• Radius two trees specify χ‐bounded classes
• Title not available (Why is that?)

Cited In (6)

• The cordiality game and the game cordiality number
• Title not available (Why is that?)
• Minimum light numbers in the \(\sigma \)-game and lit-only \(\sigma \)-game on unicyclic and grid graphs
• Range-relaxed graceful game on graphs
• Graph labeling games
• Bounds on the edge-sum distinguishing game

This page was built for publication: The game \(L(d,1)\)-labeling problem of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456896)