Pages that link to "Item:Q1337614"
From MaRDI portal
The following pages link to Equitable coloring and the maximum degree (Q1337614):
Displayed 50 items.
- On the equitable total chromatic number of cubic graphs (Q298960) (← links)
- On bipartization of cubic graphs by removal of an independent set (Q298966) (← links)
- The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (Q318921) (← links)
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs (Q326469) (← links)
- On the Corrádi-Hajnal theorem and a question of Dirac (Q345076) (← links)
- Equitable and list equitable colorings of planar graphs without 4-cycles (Q389204) (← links)
- Equitable vertex arboricity of graphs (Q394205) (← links)
- Equitable \(\Delta\)-coloring of graphs (Q411652) (← 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 versus nearly equitable coloring and the Chen-Lih-Wu Conjecture (Q555496) (← links)
- Equitable colorings of Kronecker products of graphs (Q602760) (← links)
- Equitable and equitable list colorings of graphs (Q604470) (← links)
- On equitable colorings of sparse graphs (Q726517) (← links)
- Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs (Q741756) (← links)
- Equitable defective coloring of sparse planar graphs (Q764883) (← links)
- Equitable colorings of planar graphs with maximum degree at least nine (Q764891) (← 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)
- Ore-type versions of Brooks' theorem (Q1003831) (← links)
- Equitable coloring and equitable choosability of graphs with small maximum average degree (Q1649917) (← links)
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines (Q1686064) (← links)
- Sharpening an ore-type version of the Corrádi-Hajnal theorem (Q1688267) (← links)
- Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101) (← links)
- Equitable coloring of three classes of 1-planar graphs (Q1753367) (← links)
- Total equitable list coloring (Q1756126) (← links)
- Equitable coloring of some convex polytope graphs (Q1794705) (← links)
- Equitable colorings of planar graphs without short cycles (Q1929237) (← links)
- A note on relaxed equitable coloring of graphs (Q1944202) (← links)
- Equivalence of two conjectures on equitable coloring of graphs (Q1956256) (← links)
- Equitable partition of planar graphs (Q2022132) (← 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)
- Equitable total coloring of corona of cubic graphs (Q2042627) (← links)
- On list equitable total colorings of the generalized theta graph (Q2042636) (← links)
- On the equitable choosability of the disjoint union of stars (Q2084783) (← links)
- Disjoint cycles and chorded cycles in a graph with given minimum degree (Q2174581) (← links)
- Proportional choosability: a new list analogue of equitable coloring (Q2319722) (← links)
- Equitable total-coloring of subcubic graphs (Q2341763) (← links)
- Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles (Q2345542) (← links)
- Equitable colorings of corona multiproducts of graphs (Q2409797) (← links)
- Equitable vertex arboricity of 5-degenerate graphs (Q2410094) (← links)
- The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\) (Q2454985) (← links)
- An Ore-type theorem on equitable coloring (Q2464162) (← links)
- Equitable coloring planar graphs with large girth (Q2470470) (← links)
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4 (Q2657098) (← links)
- A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
- Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring (Q2911051) (← links)
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring (Q3512604) (← links)