Pages that link to "Item:Q2911051"
From MaRDI portal
The following pages link to Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring (Q2911051):
Displaying 13 items.
- On the Corrádi-Hajnal theorem and a question of Dirac (Q345076) (← links)
- A refinement of a result of Corrádi and Hajnal (Q520047) (← links)
- On equitable colorings of sparse graphs (Q726517) (← links)
- Sharpening an ore-type version of the Corrádi-Hajnal theorem (Q1688267) (← links)
- Equitable coloring of three classes of 1-planar graphs (Q1753367) (← links)
- A note on relaxed equitable coloring of graphs (Q1944202) (← links)
- Equitable partition of planar graphs (Q2022132) (← links)
- Equitable total-coloring of subcubic graphs (Q2341763) (← links)
- Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles (Q2345542) (← links)
- Equitable vertex arboricity of 5-degenerate graphs (Q2410094) (← links)
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4 (Q2657098) (← links)
- Extremal numbers for disjoint copies of a clique (Q6202950) (← links)
- The complete value of the Turán number of \(3K_{p+1}\) (Q6204352) (← links)
