The following pages link to Symmetry breaking in graphs (Q1918875):
Displayed 50 items.
- On the local distinguishing chromatic number (Q2293833) (← links)
- On the distinguishing number of functigraphs (Q2333653) (← links)
- The distinguishing index of infinite graphs (Q2341071) (← links)
- Precise bounds for the distinguishing index of the Cartesian product (Q2357379) (← links)
- Bounds for distinguishing invariants of infinite graphs (Q2363696) (← links)
- Distinguishing graphs with intermediate growth (Q2400107) (← links)
- Breaking graph symmetries by edge colourings (Q2407385) (← links)
- A note on breaking small automorphisms in graphs (Q2410241) (← links)
- List-distinguishing Cartesian products of cliques (Q2421867) (← links)
- The distinguishing number of Cartesian products of complete graphs (Q2427541) (← links)
- Distinguishing colorings of Cartesian products of complete graphs (Q2483404) (← links)
- The distinguishing number of the augmented cube and hypercube powers (Q2483424) (← links)
- The distinguishing number of the direct product and wreath product action. (Q2509195) (← links)
- Distinguishing labellings of group action on vector spaces and graphs (Q2509274) (← links)
- Effective storage capacity of labeled graphs (Q2637317) (← links)
- Distinguishing number of hierarchical products of graphs (Q2662361) (← links)
- Labeling schemes for deterministic radio multi-broadcast (Q2672450) (← links)
- Asymmetric edge-colorings of graphs with three colors (Q2674556) (← links)
- (Q2857409) (← links)
- Distinguishing number and distinguishing index of neighbourhood corona of two graphs (Q3299359) (← links)
- Generation of Colourings and Distinguishing Colourings of Graphs (Q3449807) (← links)
- The determining number of a Cartesian product (Q3632997) (← links)
- Improving upper bounds for the distinguishing index (Q4604514) (← links)
- Symmetry breaking in planar and maximal outerplanar graphs (Q4621305) (← links)
- Stabilizing the distinguishing number of a graph (Q4633988) (← links)
- THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH (Q4956581) (← links)
- Distinguishing index of Kronecker product of two graphs (Q4958047) (← links)
- An upper bound on the distinguishing index of graphs with minimum degree at least two (Q4969593) (← links)
- The distinguishing number (index) and the domination number of a graph (Q4986551) (← links)
- The distinguishing number and the distinguishing index of graphs from primary subgraphs (Q4988455) (← links)
- On the fixing number of functigraphs (Q4991413) (← links)
- Distinguishing numbers of finite 4-valent vertex-transitive graphs (Q4993953) (← links)
- Distinguishing number and distinguishing index of strong product of two graphs (Q4998754) (← links)
- Coarse distinguishability of graphs with symmetric growth (Q5013344) (← links)
- Distinguishing number and distinguishing index of certain graphs (Q5020420) (← links)
- Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density (Q5045282) (← links)
- Distinguishing arc-colourings of symmetric digraphs (Q5058208) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- Distinguishing Generalized Mycielskian Graphs (Q5090527) (← links)
- Reconstructing a minimal topological dynamical system from a set of return times (Q5095127) (← links)
- (Q5137479) (← links)
- The distinguishing number and the distinguishing index of line and graphoidal graph(s) (Q5154552) (← links)
- The chromatic distinguishing index of certain graphs (Q5154569) (← links)
- (Q5888907) (← links)
- Fixing numbers for matroids (Q5964981) (← links)
- Distinguishing orthogonality graphs (Q6056750) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
- Asymmetric colouring of locally compact permutation groups (Q6096835) (← links)
- On distinguishing labelling of sets under the wreath product action (Q6114162) (← links)
- The distinguishing index of graphs with infinite minimum degree (Q6142658) (← links)