Pages that link to "Item:Q640414"
From MaRDI portal
The following pages link to List-distinguishing colorings of graphs (Q640414):
Displaying 19 items.
- The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
- List colouring when the chromatic number is close to the order of the graph (Q558319) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- The distinguishing chromatic number (Q815210) (← links)
- Distinguishing and distinguishing chromatic numbers of generalized Petersen graphs (Q1011889) (← links)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994) (← links)
- On the local distinguishing numbers of cycles (Q1297401) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- The list distinguishing number of Kneser graphs (Q1693128) (← links)
- List distinguishing parameters of trees (Q1946232) (← links)
- On the local distinguishing chromatic number (Q2293833) (← links)
- List supermodular coloring (Q2419323) (← links)
- List-distinguishing Cartesian products of cliques (Q2421867) (← links)
- (Q3110121) (← links)
- On neighbour-distinguishing colourings from lists (Q3439452) (← links)
- Stabilizing the distinguishing number of a graph (Q4633988) (← links)
- List coloring digraphs (Q4638642) (← links)
- List-coloring embedded graphs (Q5741780) (← links)
- (Q6166316) (← links)