Skip to main content
SpringerLink
Log in

Greedy Algorithms for the Lower and Upper Chromatic Numbers

  • Conference paper
Combinatorics, Computability and Logic

Part of the book series: Discrete Mathematics and Theoretical Computer Science ((DISCMATH))

  • 200 Accesses

Abstract

We consider and compare greedy algorithms for the lower chromatic number in classic hypergraph coloring and for the upper chromatic number in coloring of hypergraphs in such a way that every edge has at least two vertices of the same color. It is shown that from the algorithmic view point the maximization and minimization of the number of colors have a different nature.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. C. Berge. Graphs and Hypergraphs. North Holland, 1973.

    Google Scholar 

  2. C. Berge. Graphs. North Holland, 1985.

    Google Scholar 

  3. C. Berge. Hypergraphs: Combinatorics of Finite Sets. North Holland, 1989.

    Google Scholar 

  4. E. Bulgaru, V.I. Voloshin. Mixed interval hypergraphs, Discrete Appl. Math. 77 (1) (1997), 24–41.

    Article  MathSciNet  Google Scholar 

  5. G.A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25 (1961), 71–76.

    Article  MathSciNet  MATH  Google Scholar 

  6. P. Erdös, A. Hajnal. On chromatic number of graphs and set systems. A.ta Math. Acad. Sci. Hungar. 17 (1966), 61–99.

    Article  MATH  Google Scholar 

  7. A. Hajnal, J. Surânyi. Uber die Auflösung von Graphen in vollständige Teilgraphen. Ann. Univ. Sci. Budapest Eötvös Sect. Math. 1 (1958), 113–121.

    MATH  Google Scholar 

  8. F. Harary. Graph theory. Addison-Wesley, Reading, MA, 1969.

    Google Scholar 

  9. T.R. Jensen, B. Toft. Graph Coloring Problems. A Wiley-Interscience Publication, New York, 1995.

    MATH  Google Scholar 

  10. A.B. Kempe. On the geographical problem of four colors. Amer. J. Math. 2 (1879), 193–200.

    Article  MathSciNet  Google Scholar 

  11. D. Kral, J. Kratochvil, A. Proskurowski, H.-J. Voss. Coloring mixed hypertrees. Preprint MATH-AL-8–2000, Technische Universität Dresden, 2000.

    Google Scholar 

  12. S. Lizzio. Greedy algorithm for the upper chromatic number. Tesi di Laurea (M.Sc. Thesis ). Catania University, 1998.

    Google Scholar 

  13. V. Miagkov. R-uniform chordal conformal co-perfect hypergraphs. M.Sc. Thesis, Moldova State University, Chisinâu, 1997.

    Google Scholar 

  14. A. Niculitsa, V. Voloshin. About uniquely colorable mixed hypertrees. Discussiones Mathematicae Graph Theory. 20 (1), (2000) 81–91.

    MathSciNet  MATH  Google Scholar 

  15. G. Szekeres, H.S. Wilf. An inequality for the chromatic number of a graph. J. Combin. Theory 4 (1968), 1–3.

    Article  MathSciNet  Google Scholar 

  16. Zs. Tuza, V.I. Voloshin, Uncolorable mixed hypergraphs, Discrete Applied Mathematics, 99 (2000) 209–227.

    Article  MathSciNet  MATH  Google Scholar 

  17. V.G. Vizing. Critical graphs with given chromatic class. Metody Diskret. Analiz. 5 (1965), 9–17, (in Russian).

    MathSciNet  MATH  Google Scholar 

  18. V.I. Voloshin. Properties of triangulated graphs. Issledovanie operatsii i programmirovanie, Chi§inâu, Shinto, 1982, 24–32, (in Russian).

    Google Scholar 

  19. V.I. Voloshin. The mixed hypergraphs. Computer Science Journal of Moldova. 1 (1993), 45–52.

    MathSciNet  Google Scholar 

  20. V.I. Voloshin. On the upper chromatic number of a hypergraph. Australasian Journal of Combinatorics 11 (1995), 25–45.

    MathSciNet  MATH  Google Scholar 

  21. V. Voloshin, H.-J. Voss. Circular Mixed hypergraphs I: colorability and unique colorability. Preprint Inst. of Algebra MATH-AL-3–2000, Technische Universität Dresden, 2000. Congressus Numerantium, to appear.

    Google Scholar 

  22. V. Voloshin, H.-J. Voss. Circular mixed hypergraphs II: lower and upper chromatic numbers. Manuscript.

    Google Scholar 

  23. D.B. West. Introduction to Graph Theory. Prentice Hall, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, Moldovan Academy of Sciences, Chsinău, Moldova

    Vitaly Voloshin

Authors
  1. Vitaly Voloshin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Auckland, Auckland, New Zealand

    C. S. Calude  & M. J. Dinneen  & 

  2. Faculty of Mathematics and Computer Science, “Ovidius” University, Constanta, Romania

    S. Sburlan

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag London Limited

About this paper

Cite this paper

Voloshin, V. (2001). Greedy Algorithms for the Lower and Upper Chromatic Numbers. In: Calude, C.S., Dinneen, M.J., Sburlan, S. (eds) Combinatorics, Computability and Logic. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0717-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0717-0_20

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-526-7

  • Online ISBN: 978-1-4471-0717-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation