Pages that link to "Item:Q2198979"
From MaRDI portal
The following pages link to A bound for the distinguishing index of regular graphs (Q2198979):
Displaying 19 items.
- Color-blind index in graphs of very low degree (Q528569) (← links)
- On symmetries of edge and vertex colourings of graphs (Q776279) (← links)
- Distance-regular graphs, MH-colourings and MLD-colourings (Q1377805) (← links)
- Corrigendum to: ``A bound for the distinguishing index of regular graphs'' (Q2066019) (← links)
- Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed (Q2153303) (← links)
- Distinguishing index of graphs with simple automorphism groups (Q2237852) (← links)
- On colour-blind distinguishing colour pallets in regular graphs (Q2251135) (← links)
- Some bounds on the neighbor-distinguishing index of graphs (Q2352066) (← links)
- Bounds for distinguishing invariants of infinite graphs (Q2363696) (← links)
- Breaking graph symmetries by edge colourings (Q2407385) (← links)
- A note on breaking small automorphisms in graphs (Q2410241) (← links)
- Asymmetric edge-colorings of graphs with three colors (Q2674556) (← links)
- The distinguishing index of connected graphs without pendant edges (Q4988841) (← links)
- Distinguishing arc-colourings of symmetric digraphs (Q5058208) (← links)
- The distinguishing number and the distinguishing index of line and graphoidal graph(s) (Q5154552) (← links)
- The role of the Axiom of Choice in proper and distinguishing colourings (Q5881017) (← links)
- Distinguishing infinite graphs with bounded degrees (Q6081887) (← links)
- The distinguishing index of graphs with infinite minimum degree (Q6142658) (← links)
- Edge-determining sets and determining index (Q6197637) (← links)
