Pages that link to "Item:Q4446890"
From MaRDI portal
The following pages link to A list analogue of equitable coloring (Q4446890):
Displaying 35 items.
- Equitable and list equitable colorings of planar graphs without 4-cycles (Q389204) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- A refinement of a result of Corrádi and Hajnal (Q520047) (← links)
- On equitable and equitable list colorings of series-parallel graphs (Q534037) (← links)
- Equitable colorings of Kronecker products of graphs (Q602760) (← links)
- Equitable and equitable list colorings of graphs (Q604470) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Equitable colorings of Cartesian products of graphs (Q765364) (← links)
- On equitable \(\Delta\)-coloring of graphs with low average degree (Q817775) (← links)
- Equitable list colorings of planar graphs without short cycles (Q954980) (← links)
- Equitable list coloring of planar graphs without 4- and 6-cycles (Q998523) (← links)
- 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)
- Theoretical aspects of equitable partition of networks into sparse modules (Q2031046) (← 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)
- Proportional 2-choosability with a bounded palette (Q2071248) (← links)
- On the equitable choosability of the disjoint union of stars (Q2084783) (← 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 coloring planar graphs with large girth (Q2470470) (← links)
- Proportional choosability of complete bipartite graphs (Q2657094) (← links)
- Equitable list coloring of graphs with bounded degree (Q2862547) (← links)
- Equitable coloring of random graphs (Q3055766) (← links)
- Equitable list-coloring for graphs of maximum degree 3 (Q3156919) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring (Q3512604) (← links)
- EQUITABLE COLORING OF 2-DEGENERATE GRAPH AND PLANE GRAPHS WITHOUT CYCLES OF SPECIFIC LENGTHS (Q3575377) (← links)
- Equitable list coloring and treewidth (Q3633001) (← links)
- On Equitable List Arboricity of Graphs (Q5000322) (← links)
- Equitable d-degenerate Choosability of Graphs (Q5041194) (← links)
- Equitable list vertex colourability and arboricity of grids (Q5086846) (← links)
