Pages that link to "Item:Q5086846"
From MaRDI portal
The following pages link to Equitable list vertex colourability and arboricity of grids (Q5086846):
Displaying 10 items.
- Complexity of tree-coloring interval graphs equitably (Q2039688) (← links)
- A note on the equitable choosability of complete bipartite graphs (Q2042622) (← links)
- Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy (Q2072075) (← links)
- Equitable improper choosability of graphs (Q2205938) (← links)
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs (Q2220774) (← links)
- Equitable list tree-coloring of bounded treewidth graphs (Q2220879) (← links)
- Equitable vertex arboricity conjecture holds for graphs with low degeneracy (Q2230570) (← links)
- On Equitable List Arboricity of Graphs (Q5000322) (← links)
- Equitable d-degenerate Choosability of Graphs (Q5041194) (← links)
- Equitable list point arboricity of graphs (Q5279301) (← links)