An Ore-type theorem on equitable coloring
From MaRDI portal
Publication:2464162
Recommendations
Cites work
- \(H\)-factors in dense graphs
- Almost \(H\)-factors in dense graphs
- An Ore-type theorem on equitable coloring
- Equitable coloring and the maximum degree
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- scientific article; zbMATH DE number 1308943 (Why is no real title available?)
- scientific article; zbMATH DE number 1046311 (Why is no real title available?)
- scientific article; zbMATH DE number 1833421 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- Note on Hamilton Circuits
- On equitable -coloring of graphs with low average degree
- On equitable coloring of bipartite graphs
- Ore-type graph packing problems
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- Some Theorems on Abstract Graphs
- Spanning subgraphs of random graphs
- The infamous upper tail
Cited in
(50)- Ore-type versions of Brooks' theorem
- Equitable coloring and the maximum degree
- Sharpening an ore-type version of the Corrádi-Hajnal theorem
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- A note on relaxed equitable coloring of graphs
- A degree sequence version of the Kühn-Osthus tiling theorem
- Completion and deficiency problems
- Equitable colorings of hypergraphs with few edges
- A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs
- An Ore-type theorem on equitable coloring
- A degree sequence Hajnal-Szemerédi theorem
- Ramsey number of paths and connected matchings in Ore-type host graphs
- Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles
- Forcing spanning subgraphs via Ore type conditions
- Note on equitable colorings of graphs
- Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
- Triangle factors of graphs without large independent sets and of weighted graphs
- Tiling directed graphs with tournaments
- Embedding graphs having Ore-degree at most five
- A question on relaxed equitable coloring
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- A DSATUR-based algorithm for the equitable coloring problem
- On the Corrádi-Hajnal theorem and a question of Dirac
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- An Ore-type theorem on Hamiltonian square cycles
- Equitable vertex arboricity of graphs
- Equitable two-colorings of uniform hypergraphs
- A sharp Dirac-Erdős type bound for large graphs
- Embedding spanning bipartite graphs of small bandwidth
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
- Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
- A discrepancy version of the Hajnal-Szemerédi theorem
- Extremal problems in hypergraph colourings
- A refinement of a result of Corrádi and Hajnal
- A degree sequence Komlós theorem
- A fast algorithm for equitable coloring
- An extension of the Hajnal-Szemerédi theorem to directed graphs
- On directed versions of the Hajnal-Szemerédi theorem
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- Equitable colorings of Kronecker products of graphs
- Equitable oriented coloring
- Clique-factors in graphs with sublinear -independence number
- On sufficient conditions for spanning structures in dense graphs
- Ramsey-Turán type results for matchings in edge colored graphs
- Sufficient conditions for perfect mixed tilings
- On equitable colorings of sparse graphs
- Equitable colorings of Cartesian products of graphs
- On equitable -coloring of graphs with low average degree
This page was built for publication: An Ore-type theorem on equitable coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464162)
