Skip to main content
SpringerLink
Log in

Selective Graph Coloring in Some Special Classes of Graphs

  • Conference paper
Combinatorial Optimization (ISCO 2012)

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

Included in the following conference series:

Abstract

In this paper, we consider the selective graph coloring problem. Given an integer k ≥ 1 and a graph G = (V,E) with a partition V 1,…,V p of V, it consists in deciding whether there exists a set V * in G such that |V * ∩ V i | = 1 for all i ∈ {1,…,p}, and such that the graph induced by V * is k-colorable. We investigate the complexity status of this problem in various classes of graphs.

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. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall (1993)

    Google Scholar 

  2. Al-Mouhamed, M., Dandashi, A.: Graph Coloring for class scheduling. In: IEEE/ACS Internation Conference on Computer Systems and Applications (AICCSA), pp. 1–4 (2010)

    Google Scholar 

  3. Berge, C.: Graphes et hypergraphes. Dunod, Paris (1970)

    MATH  Google Scholar 

  4. Chung, Y., Demange, M.: On inverse chromatic number problems. Electronic Notes in Discrete Mathematics 36, 1129–1136 (2010)

    Article  Google Scholar 

  5. Berman, P., Karpinski, M., Scott, A.D.: Approximation Hardness of Short Symmetric Instances of MAX-3SAT. Electronic Colloquium on Computational Complexity. Technical Report TR03-049 (2003)

    Google Scholar 

  6. Chvatál, V.: A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research 4(3), 233–235 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dahlhaus, E., Seymour, P.D., Papadimitriou, C.H., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Computing 23, 864–894 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dolgui, A., Sotskov, Y.N., Werner, F.: Mixed graph coloring via unit-time job-shop. Internat. J. Math. Algorithms 2, 289–323 (2001)

    MATH  Google Scholar 

  9. Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634–652 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Fellows, M., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parametrized complexity of multiple-interval graph problems. Theoretical Computer Science 410(1), 53–61 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  11. Feremans, C., Labbe, M., Laporte, G.: Generalized network design problems. European Journal of Operations Research 148, 1–13 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gamache, M., Hertz, A., Ouellet, J.: A graph coloring model for a feasibility problem in crew scheduling. Computers and Operations Research 34, 2384–2395 (2007)

    Article  MATH  Google Scholar 

  13. Garey, M.R., Johnson, D.S.: Computers and intractability, a guide to the theory of \(\mathcal{NP}\)-completeness. Freeman, New York (1979)

    Google Scholar 

  14. Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified \(\mathcal{NP}\)-complete problems. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 47–63 (1974)

    Google Scholar 

  15. Giaro, K., Kubale, M., Obszarski, P.: A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints. Discrete Applied Mathematics 157(17), 3625–3630 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Korte, B., Vygen, J.: Combinatorial Optimization, Theory and Algorithms, 4th edn. Springer (2008)

    Google Scholar 

  17. McGrae, A.R.A., Zito, M.: Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem. In: Kolman, P., Kratochvíl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 179–190. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  18. Ries, B.: Complexity of two coloring problems in cubic planar bipartite mixed graphs. Discrete Applied Mathematics 158, 592–596 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  19. Safra, S., Schwartz, O.: On the complexity of approximating TSP with neighborhoods and related problems. Computational Complexity 14, 281–307 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  20. Sotskov, Y.N., Tanaev, V.S., Werner, F.: Scheduling problems and mixed graph colorings. Optimization 51, 597–624 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  21. Tovey, C.A.: A simplified \(\mathcal{NP}\)-complete satisfiability problem. Discrete Applied Mathematics 8, 85–89 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  22. West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ESSEC Business School, Paris, France

    Marc Demange

  2. LAMSADE, Université Paris-Dauphine, France

    Jérôme Monnot & Bernard Ries

  3. Universitatea de Nord, Baia Mare, Romania

    Petrica Pop

Authors
  1. Marc Demange
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jérôme Monnot
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Petrica Pop
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bernard Ries
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LAMSADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cedex 16, France

    A. Ridha Mahjoub  & Vangelis Th. Paschos  & 

  2. Department of Informatics, Athens University of Economics and Business, 76 Patission str., 10434, Athens, Greece

    Vangelis Markakis  & Ioannis Milis  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Demange, M., Monnot, J., Pop, P., Ries, B. (2012). Selective Graph Coloring in Some Special Classes of Graphs. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds) Combinatorial Optimization. ISCO 2012. Lecture Notes in Computer Science, vol 7422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32147-4_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32147-4_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32146-7

  • Online ISBN: 978-3-642-32147-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation