Skip to main content
SpringerLink
Log in

Strong Colorings of Hypergraphs

  • Conference paper
Approximation and Online Algorithms (WAOA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3351))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, W.W., Loustaunau, P.: An Introduction to Gröbner Bases. American Mathematical Society, Graduate Studies in Mathematics 3 (1994)

    Google Scholar 

  2. Agnarsson, G., Egilsson, Á.: On vertex coloring simple genetic digraphs. Congressus Numerantium 161, 117–127 (2004)

    MathSciNet  Google Scholar 

  3. Agnarsson, G., Egilsson, Á.S., Halldórsson, M.M.: Proper down-coloring simple acyclic digraphs. In: Pfaltz, J.L., Nagl, M., Böhlen, B. (eds.) AGTIVE 2003. LNCS, vol. 3062, pp. 299–312. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Agnarsson, G., Greenlaw, R., Halldórsson, M.M.: On Powers of Chordal Graphs and Their Colorings. Congressus Numerantium, 142–147 (2000)

    Google Scholar 

  5. Agnarsson, G., Halldórsson, M.M.: Coloring Powers of Planar Graphs. SIAM Journal of Discrete Mathematics 16(4), 651–662 (2003)

    Article  MATH  Google Scholar 

  6. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)

    Google Scholar 

  7. Feige, U., Kilian, J.: Zero Knowledge and the Chromatic number. Journal of Computer and System Sciences 57(2), 187–199 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  8. Grötschel, M., Lovász, L., Schrijver, A.: Polynomial algorithms for perfect graphs. North-Holland Math. Stud. 88 (1984)

    Google Scholar 

  9. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665. Springer, Heidelberg (1999)

    Google Scholar 

  10. Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Applied Mathematics 101, 77–114 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46, 218–270 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  12. Creszenci, P., Kann, V.: A compendium of NP-optimization problems

    Google Scholar 

  13. Garey, M.R., Johnson, D.S.: Computers and Intractability—A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA (1979)

    Google Scholar 

  14. Halldórsson, M.M., Lau, H.-C.: Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and 3-Coloring. Journal of Graph Algorithms and Applications 1(3), 1–13 (1997)

    MathSciNet  Google Scholar 

  15. Halldórsson, M.M.: A still better performance guarantee for approximate graph coloring. Information Processing Letters 45, 19–23 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  16. Halldórsson, M.M.: Approximation via Partitioning. JAIST Research Report IS-RR-95-0003F (March 1995), Available at http://www.hi.is/~mmh/Publications.html

  17. Halldórsson, M.M.: Online coloring known graphs. Electronic Journal of Combinatorics (February 2000), http://www.combinatorics.org

  18. Halldórsson, M.M., Kratochvíl, J., Telle, J.A.: Independent sets with domination constraints. Discrete Applied Mathematics 99(1-3), 39–54 (1999), www.elsevier.nl/locate/jnlnr/05267

    Article  Google Scholar 

  19. Halldórsson, M.M., Szegedy, M.: Lower bounds for on-line graph coloring. Theoretical Computer Science 130, 163–174 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  20. Hazan, E., Safra, S., Schwartz, O.: On the Hardness of Approximating k-Dimensional Matching. Electronic Colloquium on Computational Complexity, TR03-020 (2003)

    Google Scholar 

  21. Irani, S.: On-Line Coloring Inductive Graphs. Algorithmica 11, 53–72 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  22. Johansson, Ö.: Graph Decomposition Using Node Labels. Doctoral Dissertation, Royal Institute of Technology, Stockholm (2001)

    Google Scholar 

  23. Kahn, J.: Asymptotically good list-colorings. J. Combinatorial Th (A) 73, 1–59 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  24. Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Mathematics 126, 197–221 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  25. Krivelevich, M., Sudakov, B.: Approximate coloring of uniform hypergraphs (Extended abstract). In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, p. 477. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  26. Krumke, S.O., Marathe, M.V., Ravi, S.S.: Approximation algorithms for channel assignment in radio networks. In: 2nd Dial M for Mobility (1998)

    Google Scholar 

  27. Lovász, L.: On Decomposition of Graphs. Stud. Sci. Math. Hung. 1, 237–238 (1966)

    MATH  Google Scholar 

  28. Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple Heuristics for Unit Disk Graphs. Networks 25, 59–68 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  29. McCormick, S.T.: Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Math. Programming 26(2), 153–171 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  30. McMorris, F.R., Zaslavsky, T.: Bound graphs of a partially ordered set. J. Combin. Inform. System Sci. 7, 134–138 (1982)

    MATH  MathSciNet  Google Scholar 

  31. Möhring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. North-Holland Math. Stud. 95, 257–355 (1984)

    Article  Google Scholar 

  32. Molloy, M., Reed, B.: Near-optimal list colourings. Random Structures and Algorithms 17, 376–402 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  33. Molloy, M., Salavatipour, M.R.: Frequency channel assignment on planar networks. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 736–747. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  34. Motwani, R., Sudan, M.: Computing roots of graphs is hard. Discrete Appl. Math. 54, 81–88 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  35. Nishizeki, T., Kashiwagi, K.: On the 1.1 edge-coloring of multigraphs. SIAM Journal on Discrete Mathematics 3(3), 391–410 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  36. Paschos, V.Th.: Polynomial approximation and graph-coloring. Computing 70(1), 41–86 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  37. Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multi-hop radio networks. IEEE/ACM Trans. on Networking 1(2), 166–172 (1993)

    Article  Google Scholar 

  38. Robertson, N., Seymour, P.: Graph minors V, Excluding a planar graph. Journal of Combinatorial Theory (B) 41, 92–114 (1986)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, George Mason University, MS 3F2, 4400 University Drive, Fairfax, VA, 22030

    Geir Agnarsson

  2. Department of Computer Science, University of Iceland, Dunhaga 3, IS-107, Rvk, Iceland

    Magnús M. Halldórsson

Authors
  1. Geir Agnarsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Magnús M. Halldórsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica ed Applicazioni, Università di Salerno, 84084, Fisciano, (SA), Italy

    Giuseppe Persiano

  2. Department of Computer Science, The University of Western Ontario, London, Canada

    Roberto Solis-Oba

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Agnarsson, G., Halldórsson, M.M. (2005). Strong Colorings of Hypergraphs. In: Persiano, G., Solis-Oba, R. (eds) Approximation and Online Algorithms. WAOA 2004. Lecture Notes in Computer Science, vol 3351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31833-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31833-0_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24574-2

  • Online ISBN: 978-3-540-31833-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation