Pages that link to "Item:Q2509274"

The following pages link to Distinguishing labellings of group action on vector spaces and graphs (Q2509274):

Displaying 24 items.

• Endomorphism breaking in graphs (Q405090) (← links)
• Distinguishing graphs by edge-colourings (Q482130) (← links)
• The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
• Distinguishing labeling of the actions of almost simple groups. (Q663093) (← links)
• Number of distinguishing colorings and partitions (Q776312) (← links)
• Automorphisms and distinguishing numbers of geometric cliques (Q938315) (← links)
• The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145) (← links)
• Extending precolorings to distinguish group actions (Q1645056) (← links)
• On asymmetric colourings of claw-free graphs (Q2048557) (← links)
• Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed (Q2153303) (← links)
• Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
• Infinite motion and 2-distinguishability of graphs and groups (Q2256057) (← links)
• Distinguishing graphs of maximum valence 3 (Q2278113) (← links)
• The distinguishing number of quasiprimitive and semiprimitive groups (Q2311089) (← links)
• Bounds for distinguishing invariants of infinite graphs (Q2363696) (← links)
• Distinguishing graphs with intermediate growth (Q2400107) (← links)
• The distinguishing number of Cartesian products of complete graphs (Q2427541) (← links)
• The distinguishing number of the augmented cube and hypercube powers (Q2483424) (← links)
• The distinguishing number (index) and the domination number of a graph (Q4986551) (← links)
• Distinguishing numbers of finite 4-valent vertex-transitive graphs (Q4993953) (← links)
• Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
• Distinguishing threshold of graphs (Q6074586) (← links)
• Distinguishing infinite graphs with bounded degrees (Q6081887) (← links)
• Asymmetric colouring of locally compact permutation groups (Q6096835) (← links)