A fast algorithm for equitable coloring
From MaRDI portal
Publication:532129
DOI10.1007/S00493-010-2483-5zbMATH Open1224.05176OpenAlexW2084709397WikidataQ60060509 ScholiaQ60060509MaRDI QIDQ532129FDOQ532129
Authors: Marcelo Mydlarz, H. A. Kierstead, Alexandr Kostochka, Endre Szemerédi 
Publication date: 26 April 2011
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-010-2483-5
Recommendations
- An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
- A fast algorithm for computing a nearly equitable edge coloring with balanced conditions
- A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
- A polyhedral approach for the equitable coloring problem
- A DSATUR-based algorithm for the equitable coloring problem
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
- scientific article; zbMATH DE number 1302199
- scientific article; zbMATH DE number 7058467
- Structural parameterizations for equitable coloring
- scientific article; zbMATH DE number 3378938
equitable vertex colouring of graphs[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Hajnal-Szemer%EF%BF%BD%EF%BF%BDdi+theorem&go=Go Hajnal-Szemer��di theorem]
Cites Work
- An Ore-type theorem on equitable coloring
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Ore-type versions of Brooks' theorem
- Blow-up lemma
- Title not available (Why is that?)
- Spanning subgraphs of random graphs
- Perfect Graphs and an Application to Optimizing Municipal Services
- Ore-type graph packing problems
- The infamous upper tail
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
Cited In (45)
- An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
- Computing the partition function for graph homomorphisms with multiplicities
- An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
- A polyhedral approach for the equitable coloring problem
- New Bounds for the Nearly Equitable Edge Coloring Problem
- A flow based pruning scheme for enumerative equitable coloring algorithms
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
- Equitable colorings of \(l\)-corona products of cubic graphs
- Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
- Equitable colourings of Borel graphs
- Edge-decompositions of graphs with high minimum degree
- A fast algorithm for computing a nearly equitable edge coloring with balanced conditions
- Approximate multipartite version of the Hajnal-Szemerédi theorem
- Constructing Armstrong tables for general cardinality constraints and not-null constraints
- Introduction to dominated edge chromatic number of a graph
- Improving lower bounds for equitable chromatic number
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4
- An Ore-type theorem on equitable coloring
- Equitable partition of graphs into induced forests
- Equitable two-colorings of uniform hypergraphs
- Asymptotic multipartite version of the Alon-Yuster theorem
- A greedy algorithm for the social golfer and the Oberwolfach problem
- The complexity of perfect matchings and packings in dense hypergraphs
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors
- Extremal numbers for disjoint copies of a clique
- A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
- A Tabu Search Heuristic for the Equitable Coloring Problem
- Results about the total chromatic number and the conformability of some families of circulant graphs
- A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- On equitable colorings of hypergraphs
- Equitable colorings of hypergraphs with few edges
- Equitable list coloring of graphs with bounded degree
- Equitable total-coloring of subcubic graphs
- A note on relaxed equitable coloring of graphs
- Title not available (Why is that?)
- Equitable partition of planar graphs
- Equitable colorings of corona multiproducts of graphs
- On the Corrádi-Hajnal theorem and a question of Dirac
- A refinement of a result of Corrádi and Hajnal
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
- Title not available (Why is that?)
- On equitable colouring of Knödel graphs
This page was built for publication: A fast algorithm for equitable coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q532129)
