Pages that link to "Item:Q1044994"
From MaRDI portal
The following pages link to On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994):
Displaying 16 items.
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Distinguishing trees in linear time (Q426889) (← links)
- The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
- On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (Q626859) (← links)
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs (Q724854) (← links)
- On computing the distinguishing numbers of trees and forests (Q813439) (← links)
- On the chromatic number of multiple interval graphs and overlap graphs (Q1061131) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- Proper distinguishing colorings with few colors for graphs with girth at least 5 (Q1658779) (← links)
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture (Q2026341) (← links)
- A note on computable distinguishing colorings (Q2030129) (← links)
- Distinguishing numbers and distinguishing indices of oriented graphs (Q2197442) (← links)
- On the local distinguishing chromatic number (Q2293833) (← links)
- List-distinguishing Cartesian products of cliques (Q2421867) (← links)
- Distinguishing number of hierarchical products of graphs (Q2662361) (← links)
- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs (Q5452164) (← links)
