Results on the graceful game and range-relaxed graceful game

DOI10.1007/978-3-030-83823-2_34MaRDI QIDQ6604698zbMATH OpenFDO

Authors D. L. Oliveira, Sheldon Dantas, Atílio G. Luiz

Publication date 13 September 2024

zbMATH Keywords

graceful labelingmaker-breaker gamegraph labeling game

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites work

• scientific article; zbMATH DE number 165079 (Why is no real title available?)
• scientific article; zbMATH DE number 3458691 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph
• Colouring games
• Graph labeling games
• Improved bounds for relaxed graceful trees
• Labelling Graphs with a Condition at Distance 2
• On Additive Bases and Harmonious Graphs
• On the complexity of constructing Golomb rulers
• On the corona of two graphs
• Relaxed graceful labellings of trees
• Strongly graceful graphs
• Two sets of graceful graphs

Cited in

(1)

• The \((a, b)\)-monochromatic transversal game on clique-hypergraphs of powers of cycles

This page was built for publication: Results on the graceful game and range-relaxed graceful game

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