Pages that link to "Item:Q2576842"
From MaRDI portal
The following pages link to An algorithm for partial Grundy number on trees (Q2576842):
Displaying 10 items.
- Color chain of a graph (Q659728) (← links)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) (← links)
- Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs (Q1683560) (← links)
- Interpolation theorem for partial Grundy coloring (Q1946663) (← links)
- On partial Grundy coloring of bipartite graphs and chordal graphs (Q2009016) (← links)
- \(b\)-continuity and partial Grundy coloring of graphs with large girth (Q2185922) (← links)
- Grundy coloring in some subclasses of bipartite graphs and their complements (Q2203596) (← links)
- On the family of \(r\)-regular graphs with Grundy number \(r+1\) (Q2449171) (← links)
- (Q3464055) (← links)
- Algorithms for Vertex Partitioning Problems on Partial k-Trees (Q4377448) (← links)