Pages that link to "Item:Q2341071"
From MaRDI portal
The following pages link to The distinguishing index of infinite graphs (Q2341071):
Displaying 17 items.
- Endomorphism breaking in graphs (Q405090) (← links)
- Distinguishing graphs by edge-colourings (Q482130) (← links)
- Infinite graphs with finite 2-distinguishing cost (Q490268) (← links)
- Edge motion and the distinguishing index (Q526904) (← links)
- On symmetries of edge and vertex colourings of graphs (Q776279) (← links)
- A bound for the distinguishing index of regular graphs (Q2198979) (← links)
- Distinguishing graphs of maximum valence 3 (Q2278113) (← links)
- Bounds for distinguishing invariants of infinite graphs (Q2363696) (← links)
- Distinguishing infinite graphs (Q2372880) (← links)
- Breaking graph symmetries by edge colourings (Q2407385) (← links)
- (Q3201083) (← links)
- The distinguishing index of the Cartesian product of countable graphs (Q4597478) (← links)
- The distinguishing index of connected graphs without pendant edges (Q4988841) (← 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)
- The distinguishing index of graphs with infinite minimum degree (Q6142658) (← links)