On the graphs with distinguishing number equal list distinguishing number
From MaRDI portal
(Redirected from Publication:6166316)
Recommendations
Cites work
- A branch and price algorithm for list coloring problem
- Bounding the distinguishing number of infinite graphs and permutation groups
- Distinguishing graphs by edge-colourings
- Distinguishing number and distinguishing index of certain graphs
- Exploring the complexity boundary between coloring and list-coloring
- Handbook of product graphs
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- List distinguishing number of \(p^{\text{th}}\) power of hypercube and Cartesian powers of a graph
- List distinguishing parameters of trees
- List-distinguishing colorings of graphs
- On computing the distinguishing numbers of trees and forests
- Symmetry breaking in graphs
- The distinguishing chromatic number
- The distinguishing number of the augmented cube and hypercube powers
- THE DISTINGUISHING NUMBERS OF MERGED JOHNSON GRAPHS
- The list distinguishing number equals the distinguishing number for interval graphs
This page was built for publication: On the graphs with distinguishing number equal list distinguishing number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166316)