Pages that link to "Item:Q532129"

The following pages link to A fast algorithm for equitable coloring (Q532129):

Displaying 36 items.

• On the Corrádi-Hajnal theorem and a question of Dirac (Q345076) (← links)
• Approximate multipartite version of the Hajnal-Szemerédi theorem (Q412166) (← links)
• Equitable two-colorings of uniform hypergraphs (Q458597) (← links)
• A refinement of a result of Corrádi and Hajnal (Q520047) (← links)
• Computing the partition function for graph homomorphisms with multiplicities (Q889510) (← links)
• Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101) (← links)
• A flow based pruning scheme for enumerative equitable coloring algorithms (Q1730611) (← links)
• A note on relaxed equitable coloring of graphs (Q1944202) (← links)
• Equitable partition of planar graphs (Q2022132) (← links)
• Improving lower bounds for equitable chromatic number (Q2147053) (← links)
• Constructing Armstrong tables for general cardinality constraints and not-null constraints (Q2254637) (← links)
• The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
• On equitable colorings of hypergraphs (Q2291188) (← links)
• Equitable colorings of hypergraphs with few edges (Q2309544) (← links)
• Equitable total-coloring of subcubic graphs (Q2341763) (← links)
• Equitable partition of graphs into induced forests (Q2342637) (← links)
• A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs (Q2353014) (← links)
• Asymptotic multipartite version of the Alon-Yuster theorem (Q2407378) (← links)
• Equitable colorings of corona multiproducts of graphs (Q2409797) (← 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)
• Equitable List Coloring of Graphs with Bounded Degree (Q2862547) (← links)
• Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring (Q2911051) (← links)
• On equitable colouring of Knödel graphs (Q2935368) (← links)
• A Tabu Search Heuristic for the Equitable Coloring Problem (Q3195344) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668) (← links)
• Introduction to dominated edge chromatic number of a graph (Q5004071) (← links)
• Equitable colourings of Borel graphs (Q5014071) (← links)
• An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs (Q5364255) (← links)
• Edge-decompositions of graphs with high minimum degree (Q5899605) (← links)
• Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)
• Results about the total chromatic number and the conformability of some families of circulant graphs (Q6094719) (← links)
• Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
• Extremal numbers for disjoint copies of a clique (Q6202950) (← links)
• Equitable colorings of \(l\)-corona products of cubic graphs (Q6577196) (← links)