Pages that link to "Item:Q2363696"

The following pages link to Bounds for distinguishing invariants of infinite graphs (Q2363696):

Displaying 27 items.

• Endomorphism breaking in graphs (Q405090) (← links)
• Infinite graphs with finite 2-distinguishing cost (Q490268) (← links)
• Distinguishing number and adjacency properties (Q543989) (← links)
• On symmetries of edge and vertex colourings of graphs (Q776279) (← links)
• Number of distinguishing colorings and partitions (Q776312) (← links)
• A graph-theoretic bound on the number of independent absolutely continuous invariant measures (Q1122019) (← links)
• Finite invariant sets in infinite graphs (Q1815321) (← links)
• On asymmetric colourings of claw-free graphs (Q2048557) (← links)
• Non-standard limits of graphs and some orbit equivalence invariants (Q2077189) (← links)
• The distinguishing number and distinguishing chromatic number for posets (Q2088064) (← links)
• Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
• Distinguishing density and the distinct spheres condition (Q2198972) (← links)
• A bound for the distinguishing index of regular graphs (Q2198979) (← links)
• Infinite motion and 2-distinguishability of graphs and groups (Q2256057) (← links)
• Distinguishing graphs of maximum valence 3 (Q2278113) (← links)
• The distinguishing index of infinite graphs (Q2341071) (← links)
• Distinguishing infinite graphs (Q2372880) (← links)
• Distinguishing graphs with intermediate growth (Q2400107) (← links)
• Buser's inequality on infinite graphs (Q2633797) (← links)
• Distinguishing graphs by total colourings (Q2835392) (← links)
• Distinguishing graphs with infinite motion and nonlinear growth (Q3191457) (← links)
• Large <i>k</i>‐preserving sets in infinite graphs (Q4297826) (← links)
• Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
• The optimal general upper bound for the distinguishing index of infinite graphs (Q5110667) (← links)
• The role of the Axiom of Choice in proper and distinguishing colourings (Q5881017) (← links)
• Distinguishing threshold of graphs (Q6074586) (← links)
• Distinguishing infinite graphs with bounded degrees (Q6081887) (← links)