Pages that link to "Item:Q5110667"
From MaRDI portal
The following pages link to The optimal general upper bound for the distinguishing index of infinite graphs (Q5110667):
Displaying 9 items.
- Infinite graphs with finite 2-distinguishing cost (Q490268) (← links)
- On asymmetric colourings of claw-free graphs (Q2048557) (← links)
- A bound for the distinguishing index of regular graphs (Q2198979) (← links)
- The distinguishing index of infinite graphs (Q2341071) (← links)
- Bounds for distinguishing invariants of infinite graphs (Q2363696) (← links)
- Asymmetric edge-colorings of graphs with three colors (Q2674556) (← links)
- The distinguishing index of the Cartesian product of countable graphs (Q4597478) (← links)
- Improving upper bounds for the distinguishing index (Q4604514) (← links)
- The role of the Axiom of Choice in proper and distinguishing colourings (Q5881017) (← links)