Distinguishing Cartesian powers of graphs
From MaRDI portal
Recommendations
- Cartesian powers of graphs can be distinguished by two labels
- Distinguishing Cartesian powers of graphs
- List distinguishing number of \(p^{\text{th}}\) power of hypercube and Cartesian powers of a graph
- The distinguishing number of Cartesian products of complete graphs
- Distinguishing Cartesian products of countable graphs
Cited in
(48)- deBruijn-like sequences and the irregular chromatic number of paths and cycles
- Extending precolorings to distinguish group actions
- The distinguishing number of the hypercube
- The cost of 2-distinguishing Cartesian powers
- Asymmetric colorings of products of graphs and digraphs
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
- The cost of 2-distinguishing hypercubes
- Symmetry parameters for Mycielskian graphs
- Trees with distinguishing number two
- Distinguishing numbers and distinguishing indices of oriented graphs
- Precise bounds for the distinguishing index of the Cartesian product
- Distinguishing graphs with intermediate growth
- The distinguishing number of Cartesian products of complete graphs
- Distinguishing colorings of Cartesian products of complete graphs
- The distinguishing number of the augmented cube and hypercube powers
- Game distinguishing numbers of Cartesian products
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
- The determining number of a Cartesian product
- Improving upper bounds for the distinguishing index
- Distinguishing number and distinguishing index of natural and fractional powers of graphs
- Distinguishing index of Kronecker product of two graphs
- Distinguishing number and distinguishing index of strong product of two graphs
- Distinguishing Cartesian products of countable graphs
- The list distinguishing number equals the distinguishing number for interval graphs
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
- Paint cost and the frugal distinguishing number
- Symmetry parameters of various hypercube families
- Distinguishing generalized Mycielskian graphs
- The distinguishing index of the Cartesian product of finite graphs
- scientific article; zbMATH DE number 7678748 (Why is no real title available?)
- Distinguishing Cartesian powers of graphs
- Distinguishing orthogonality graphs
- Distinguishing threshold of graphs
- The number of distinguishing colorings of a Cartesian product graph
- Transitive coloring of graphs
- On the distinguishing chromatic number of the Kronecker products of graphs
- Paint cost spectrum of perfect k-ary trees
- Distinguishing number of inverse graphs of finite groups: labeling the symmetry
- Uniquely proper distinguishing colorable graphs
- Determining number and cost of generalized Mycielskian graphs
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
- Breaking symmetry in graphs by resolving sets
- Number of distinguishing colorings and partitions
- List distinguishing number of \(p^{\text{th}}\) power of hypercube and Cartesian powers of a graph
- Cartesian powers of graphs can be distinguished by two labels
- Automorphisms and distinguishing numbers of geometric cliques
- The distinguishing chromatic number of Cartesian products of two complete graphs
- Connectivity of Cartesian products of graphs
This page was built for publication: Distinguishing Cartesian powers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898352)
