Pages that link to "Item:Q1759824"
From MaRDI portal
The following pages link to On the Grundy number of graphs with few \(P_4\)'s (Q1759824):
Displaying 9 items.
- Grundy dominating sequences on \(X\)-join product (Q777371) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- PSPACE-hardness of two graph coloring games (Q2132363) (← links)
- PSPACE-completeness of two graph coloring games (Q2182325) (← links)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5874480) (← links)