Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
On the 1.1 edge-coloring of multigraphs
SIAM Journal on Discrete Mathematics
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
A still better performance guarantee for approximate graph coloring
Information Processing Letters
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
Computing roots of graphs is hard
Discrete Applied Mathematics
Lower bounds for on-line graph coloring
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Asymptotically good list-colorings
Journal of Combinatorial Theory Series A
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Graph classes: a survey
Independent sets with domination constraints
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Proceedings of the ninth international conference on on Random structures and algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximate Coloring of Uniform Hypergraphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Frequency Channel Assignment on Planar Networks
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Coloring Powers of Planar Graphs
SIAM Journal on Discrete Mathematics
The complexity of vertex coloring problems in uniform hypergraphs with high degree
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Information Processing Letters
The design space of probing algorithms for network-performance measurement
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
| Hi-index | 0.00 |
A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph coloring problems. We present nearly tight upper and lower bound on approximating general hypergraphs, both offline and online. We then consider various parameters that make coloring easier, and give a unified treatment. In particular, we give an algebraic scheme using integer programming to color graphs of bounded composition-width.