Pages that link to "Item:Q482130"
From MaRDI portal
The following pages link to Distinguishing graphs by edge-colourings (Q482130):
Displaying 41 items.
- Edge motion and the distinguishing index (Q526904) (← links)
- On symmetries of edge and vertex colourings of graphs (Q776279) (← links)
- Number of distinguishing colorings and partitions (Q776312) (← links)
- Edge-distinguishing of star-free graphs (Q785585) (← links)
- The distinguishing number and distinguishing index of the lexicographic product of two graphs (Q1649920) (← links)
- Distinguishing index of maps (Q2011148) (← links)
- On asymmetric colourings of claw-free graphs (Q2048557) (← links)
- Proper distinguishing arc-colourings of symmetric digraphs (Q2079126) (← links)
- Extremal graphs for the distinguishing index (Q2142642) (← links)
- Equitable distinguishing chromatic number (Q2147524) (← links)
- Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
- Distinguishing numbers and distinguishing indices of oriented graphs (Q2197442) (← links)
- A bound for the distinguishing index of regular graphs (Q2198979) (← links)
- Distinguishing index of graphs with simple automorphism groups (Q2237852) (← links)
- Distinguishing graphs of maximum valence 3 (Q2278113) (← links)
- On the distinguishing number of functigraphs (Q2333653) (← links)
- The distinguishing index of infinite graphs (Q2341071) (← links)
- Precise bounds for the distinguishing index of the Cartesian product (Q2357379) (← 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)
- Distinguishing number and distinguishing index of neighbourhood corona of two graphs (Q3299359) (← links)
- Nordhaus-Gaddum type inequalities for the distinguishing index (Q3390050) (← links)
- Improving upper bounds for the distinguishing index (Q4604514) (← links)
- Symmetry breaking in planar and maximal outerplanar graphs (Q4621305) (← links)
- Distinguishing index of Kronecker product of two graphs (Q4958047) (← links)
- An upper bound on the distinguishing index of graphs with minimum degree at least two (Q4969593) (← links)
- The distinguishing number (index) and the domination number of a graph (Q4986551) (← links)
- The distinguishing number and the distinguishing index of graphs from primary subgraphs (Q4988455) (← links)
- The distinguishing index of connected graphs without pendant edges (Q4988841) (← links)
- Distinguishing number and distinguishing index of strong product of two graphs (Q4998754) (← links)
- Distinguishing number and distinguishing index of certain graphs (Q5020420) (← links)
- Distinguishing arc-colourings of symmetric digraphs (Q5058208) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- The distinguishing number and the distinguishing index of line and graphoidal graph(s) (Q5154552) (← links)
- The chromatic distinguishing index of certain graphs (Q5154569) (← links)
- The role of the Axiom of Choice in proper and distinguishing colourings (Q5881017) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
- The distinguishing index of graphs with infinite minimum degree (Q6142658) (← links)
- (Q6166316) (← links)
