An Ore-type theorem on equitable coloring
From MaRDI portal
Publication:2464162
DOI10.1016/j.jctb.2007.07.003zbMath1127.05039OpenAlexW2101846098MaRDI QIDQ2464162
Alexandr V. Kostochka, Henry A. Kierstead
Publication date: 10 December 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.07.003
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (43)
Ramsey number of paths and connected matchings in Ore-type host graphs ⋮ A QUESTION ON RELAXED EQUITABLE COLORING ⋮ Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring ⋮ Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs ⋮ A DSATUR-based algorithm for the equitable coloring problem ⋮ On the Corrádi-Hajnal theorem and a question of Dirac ⋮ An Ore-type theorem on Hamiltonian square cycles ⋮ Equitable colorings of Kronecker products of graphs ⋮ Equitable vertex arboricity of graphs ⋮ Clique-factors in graphs with sublinear -independence number ⋮ Sharpening an ore-type version of the Corrádi-Hajnal theorem ⋮ Triangle factors of graphs without large independent sets and of weighted graphs ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Ramsey-Turán type results for matchings in edge colored graphs ⋮ A degree sequence version of the Kühn-Osthus tiling theorem ⋮ Extremal problems in hypergraph colourings ⋮ A note on relaxed equitable coloring of graphs ⋮ Completion and deficiency problems ⋮ An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs ⋮ On Directed Versions of the Hajnal–Szemerédi Theorem ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Equitable two-colorings of uniform hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A Sharp Dirac–Erdős Type Bound for Large Graphs ⋮ A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives ⋮ An Ore-type theorem on equitable coloring ⋮ Embedding Spanning Bipartite Graphs of Small Bandwidth ⋮ A refinement of a result of Corrádi and Hajnal ⋮ A fast algorithm for equitable coloring ⋮ On equitable colorings of sparse graphs ⋮ Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles ⋮ Ore-type versions of Brooks' theorem ⋮ Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms ⋮ Equitable colorings of hypergraphs with few edges ⋮ Strengthening Theorems of Dirac and Erdős on Disjoint Cycles ⋮ Equitable colorings of Cartesian products of graphs ⋮ A Degree Sequence Komlós Theorem ⋮ A discrepancy version of the Hajnal–Szemerédi theorem ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS ⋮ Embedding Graphs Having Ore-Degree at Most Five ⋮ Forcing spanning subgraphs via Ore type conditions ⋮ A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs ⋮ A degree sequence Hajnal-Szemerédi theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- On equitable \(\Delta\)-coloring of graphs with low average degree
- Spanning subgraphs of random graphs
- Almost \(H\)-factors in dense graphs
- Equitable coloring and the maximum degree
- On equitable coloring of bipartite graphs
- \(H\)-factors in dense graphs
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- An Ore-type theorem on equitable coloring
- Note on Hamilton Circuits
- Ore-type graph packing problems
- The infamous upper tail
- Some Theorems on Abstract Graphs
This page was built for publication: An Ore-type theorem on equitable coloring
