Pages that link to "Item:Q1337614"
From MaRDI portal
The following pages link to Equitable coloring and the maximum degree (Q1337614):
Displaying 16 items.
- 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 coloring parameters of certain graph classes (Q4554571) (← links)
- Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling (Q4971610) (← links)
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668) (← links)
- On Equitable List Arboricity of Graphs (Q5000322) (← links)
- Equitable colourings of Borel graphs (Q5014071) (← links)
- Equitable chromatic number of weak modular product of Some graphs (Q5039443) (← links)
- EQUITABLE CHROMATIC NUMBER OF SOME WHEEL RELATED GRAPHS (Q5076244) (← links)
- On certain parameters of equitable coloring of graphs (Q5370829) (← links)
- On the equitable chromatic number of complete \(n\)-partite graphs (Q5951975) (← links)
- Extremal numbers for disjoint copies of a clique (Q6202950) (← links)
- Equitable and \(m\)-bounded coloring of split graphs (Q6567664) (← links)
- Equitable colorings of \(l\)-corona products of cubic graphs (Q6577196) (← links)
- Equitable cluster partition of planar graphs with girth at least 12 (Q6583580) (← links)
- Equitable coloring in 1-planar graphs (Q6646408) (← links)