Pages that link to "Item:Q5154569"
From MaRDI portal
The following pages link to The chromatic distinguishing index of certain graphs (Q5154569):
Displaying 21 items.
- Upper bounds on vertex distinguishing chromatic indices of some Halin graphs (Q377916) (← links)
- Distinguishing graphs by edge-colourings (Q482130) (← links)
- Edge-distinguishing index of a graph (Q489314) (← links)
- The chromatic index of a graph whose core is a cycle of order at most 13 (Q742593) (← links)
- A generalization of chromatic index (Q1313837) (← links)
- The distinguishing number and distinguishing index of the lexicographic product of two graphs (Q1649920) (← links)
- On the chromatic index of path decompositions (Q1876679) (← links)
- Chromatic index of simple hypergraphs (Q2005680) (← links)
- Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
- Distinguishing numbers and distinguishing indices of oriented graphs (Q2197442) (← links)
- Distinguishing index of graphs with simple automorphism groups (Q2237852) (← links)
- Precise bounds for the distinguishing index of the Cartesian product (Q2357379) (← links)
- Distinguishing number and distinguishing index of neighbourhood corona of two graphs (Q3299359) (← links)
- (Q3356320) (← links)
- (Q3360892) (← links)
- (Q3984228) (← links)
- Distinguishing number and distinguishing index of strong product of two graphs (Q4998754) (← links)
- Distinguishing number and distinguishing index of certain graphs (Q5020420) (← links)
- The distinguishing chromatic number of bipartite graphs of girth at least six (Q5122711) (← links)
- The distinguishing index of the Cartesian product of finite graphs (Q5357290) (← links)
- Edge-determining sets and determining index (Q6197637) (← links)
