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

DOI10.1016/J.DISC.2012.07.002zbMath1251.05105OpenAlexW50257190MaRDI QIDQ456896

J. Herrera, D. Rodríguez-Gómez

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (1)

Graph labeling games

Cites Work

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

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