Pages that link to "Item:Q2862547"
From MaRDI portal
The following pages link to Equitable list coloring of graphs with bounded degree (Q2862547):
Displaying 17 items.
- Equitable coloring and equitable choosability of graphs with small maximum average degree (Q1649917) (← links)
- Total equitable list coloring (Q1756126) (← links)
- Equitable list coloring of graphs (Q1771536) (← links)
- A note on relaxed equitable coloring of graphs (Q1944202) (← links)
- A note on the equitable choosability of complete bipartite graphs (Q2042622) (← links)
- On list equitable total colorings of the generalized theta graph (Q2042636) (← links)
- A simple characterization of proportionally 2-choosable graphs (Q2175799) (← links)
- Equitable improper choosability of graphs (Q2205938) (← links)
- Proportional choosability: a new list analogue of equitable coloring (Q2319722) (← links)
- Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles (Q2345542) (← links)
- Equitable and list equitable colorings of graphs with bounded maximum average degree. (Q2828915) (← links)
- Equitable list-coloring for graphs of maximum degree 3 (Q3156919) (← links)
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring (Q3512604) (← links)
- Equitable list coloring and treewidth (Q3633001) (← links)
- A list analogue of equitable coloring (Q4446890) (← links)
- On Equitable List Arboricity of Graphs (Q5000322) (← links)
- Equitable list vertex colourability and arboricity of grids (Q5086846) (← links)