Pages that link to "Item:Q2407385"
From MaRDI portal
The following pages link to Breaking graph symmetries by edge colourings (Q2407385):
Displaying 15 items.
- On symmetries of edge and vertex colourings of graphs (Q776279) (← links)
- On asymmetric colourings of claw-free graphs (Q2048557) (← links)
- The distinguishing number and distinguishing chromatic number for posets (Q2088064) (← links)
- Extremal graphs for the distinguishing index (Q2142642) (← 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)
- A bound for the distinguishing index of regular graphs (Q2198979) (← links)
- Distinguishing index of graphs with simple automorphism groups (Q2237852) (← links)
- New algorithm for calculating chromatic index of graphs and its applications (Q2338156) (← links)
- Bounds for distinguishing invariants of infinite graphs (Q2363696) (← links)
- Asymmetric edge-colorings of graphs with three colors (Q2674556) (← links)
- The distinguishing index of connected graphs without pendant edges (Q4988841) (← links)
- Distinguishing infinite graphs with bounded degrees (Q6081887) (← links)
- Asymmetric colouring of locally compact permutation groups (Q6096835) (← links)
- The distinguishing index of graphs with infinite minimum degree (Q6142658) (← links)
