Pages that link to "Item:Q2220879"
From MaRDI portal
The following pages link to Equitable list tree-coloring of bounded treewidth graphs (Q2220879):
Displaying 7 items.
- Theoretical aspects of equitable partition of networks into sparse modules (Q2031046) (← links)
- Complexity of tree-coloring interval graphs equitably (Q2039688) (← links)
- Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy (Q2072075) (← links)
- Equitable vertex arboricity conjecture holds for graphs with low degeneracy (Q2230570) (← links)
- Equitable and list equitable colorings of graphs with bounded maximum average degree. (Q2828915) (← links)
- On Equitable List Arboricity of Graphs (Q5000322) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311095) (← links)