scientific article; zbMATH DE number 7708022

DOI10.22103/jmmr.2023.20163.1333zbMath1524.05260arXiv1711.08887MaRDI QIDQ6166316

Samaneh Soltani, Saeid Alikhani

Publication date: 6 July 2023

Full work available at URL: https://arxiv.org/abs/1711.08887

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

distinguishing numberlist distinguishing chromatic numberlist-distinguishing labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distinguishing graphs by edge-colourings
• The list distinguishing number equals the distinguishing number for interval graphs
• List-distinguishing colorings of graphs
• Bounding the distinguishing number of infinite graphs and permutation groups
• List distinguishing number of \(p^{\text{th}}\) power of hypercube and Cartesian powers of a graph
• On computing the distinguishing numbers of trees and forests
• The distinguishing chromatic number
• Symmetry breaking in graphs
• List distinguishing parameters of trees
• A branch and price algorithm for list coloring problem
• The distinguishing number of the augmented cube and hypercube powers
• Distinguishing number and distinguishing index of certain graphs
• THE DISTINGUISHING NUMBERS OF MERGED JOHNSON GRAPHS
• Exploring the complexity boundary between coloring and list-coloring

This page was built for publication: