Pages that link to "Item:Q813439"
From MaRDI portal
The following pages link to On computing the distinguishing numbers of trees and forests (Q813439):
Displaying 18 items.
- Distinguishing graphs by edge-colourings (Q482130) (← links)
- The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
- The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145) (← links)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture (Q2026341) (← links)
- Equitable distinguishing chromatic number (Q2147524) (← links)
- Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
- Trees with distinguishing number two (Q2176156) (← links)
- On the local distinguishing chromatic number (Q2293833) (← links)
- On the distinguishing number of functigraphs (Q2333653) (← links)
- List-distinguishing Cartesian products of cliques (Q2421867) (← links)
- The distinguishing number of Cartesian products of complete graphs (Q2427541) (← links)
- The distinguishing number of the augmented cube and hypercube powers (Q2483424) (← links)
- Distinguishing number of hierarchical products of graphs (Q2662361) (← links)
- Generation of Colourings and Distinguishing Colourings of Graphs (Q3449807) (← links)
- Distinguishing index of Kronecker product of two graphs (Q4958047) (← links)
- (Q6166316) (← links)
