Pages that link to "Item:Q2464162"

The following pages link to An Ore-type theorem on equitable coloring (Q2464162):

Displaying 43 items.

• A degree sequence Hajnal-Szemerédi theorem (Q256981) (← links)
• Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
• Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs (Q326469) (← links)
• A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
• On the Corrádi-Hajnal theorem and a question of Dirac (Q345076) (← links)
• An Ore-type theorem on Hamiltonian square cycles (Q354425) (← links)
• Equitable vertex arboricity of graphs (Q394205) (← links)
• Equitable two-colorings of uniform hypergraphs (Q458597) (← 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)
• A fast algorithm for equitable coloring (Q532129) (← links)
• Equitable colorings of Kronecker products of graphs (Q602760) (← links)
• On equitable colorings of sparse graphs (Q726517) (← links)
• Equitable colorings of Cartesian products of graphs (Q765364) (← links)
• Ore-type versions of Brooks' theorem (Q1003831) (← links)
• Sharpening an ore-type version of the Corrádi-Hajnal theorem (Q1688267) (← links)
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
• A note on relaxed equitable coloring of graphs (Q1944202) (← links)
• A degree sequence version of the Kühn-Osthus tiling theorem (Q2195226) (← links)
• Completion and deficiency problems (Q2200922) (← links)
• Equitable colorings of hypergraphs with few edges (Q2309544) (← links)
• A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs (Q2353014) (← links)
• An Ore-type theorem on equitable coloring (Q2464162) (← links)
• Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles (Q2800590) (← links)
• Forcing spanning subgraphs via Ore type conditions (Q2851473) (← links)
• Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring (Q2911051) (← links)
• Triangle factors of graphs without large independent sets and of weighted graphs (Q2953695) (← links)
• TILING DIRECTED GRAPHS WITH TOURNAMENTS (Q3119461) (← links)
• Embedding Graphs Having Ore-Degree at Most Five (Q3119788) (← links)
• A QUESTION ON RELAXED EQUITABLE COLORING (Q3166752) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• A Sharp Dirac–Erdős Type Bound for Large Graphs (Q4635509) (← links)
• Embedding Spanning Bipartite Graphs of Small Bandwidth (Q4903263) (← links)
• Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668) (← links)
• Strengthening Theorems of Dirac and Erdős on Disjoint Cycles (Q4978446) (← links)
• A discrepancy version of the Hajnal–Szemerédi theorem (Q4993133) (← links)
• Extremal problems in hypergraph colourings (Q5112450) (← links)
• A Degree Sequence Komlós Theorem (Q5238748) (← links)
• An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs (Q5364255) (← links)
• On Directed Versions of the Hajnal–Szemerédi Theorem (Q5364261) (← links)
• Clique-factors in graphs with sublinear -independence number (Q6064154) (← links)
• On sufficient conditions for spanning structures in dense graphs (Q6075109) (← links)
• Ramsey-Turán type results for matchings in edge colored graphs (Q6136669) (← links)