Skip to main content
SpringerLink
Log in

Obtaining Online Ecological Colourings by Generalizing First-Fit

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

A colouring of a graph is ecological if every pair of vertices that have the same set of colours in their neighbourhood are coloured alike. We consider the following problem: if a graph G and an ecological colouring c of G are given, can further vertices added to G, one at a time, be coloured so that at each stage the current graph is ecologically coloured? If the answer is yes, then we say that the pair (G,c) is ecologically online extendible. By generalizing the well-known First-Fit algorithm, we are able to characterize when (G,c) is ecologically online extendible, and to show that deciding whether (G,c) is ecologically extendible can be done in polynomial time. We also describe when the extension is possible using only colours from a given finite set C.

For the case where c is a colouring of G in which each vertex is coloured distinctly, we give a simple characterization of when (G,c) is ecologically online extendible using only the colours of c, and we also show that (G,c) is always online extendible using the colours of c plus one extra colour.

We also study (off-line) ecological H-colourings (an H-colouring of G is a homomorphism from G to H). We study the problem of deciding whether G has an ecological H-colouring for some fixed H and give a characterization of its computational complexity in terms of the structure of H.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Bodirsky, M., Kára, J., Martin, B.: The complexity of surjective homomorphism problems—a survey. Discrete Appl. Math. 160, 1680–1690 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  2. Borgatti, S.P., Everett, M.G.: Graph colorings and power in experimental exchange networks. Soc. Netw. 14, 287–308 (1992)

    Article  Google Scholar 

  3. Borgatti, S.P., Everett, M.G.: Ecological and perfect colorings. Soc. Netw. 16, 43–55 (1994)

    Article  MathSciNet  Google Scholar 

  4. Burt, R.S.: STRUCTURE Version 4.2 Reference Manual, Center for the Social Sciences, Columbia University, New York (1991)

  5. Crescenzi, P., Di Ianni, M., Greco, F., Rossi, G., Vocca, P.: On the existence of ecological colouring. In: Proc. of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 5344, pp. 90–100. Springer, Berlin (2008)

    Chapter  Google Scholar 

  6. Erickson, E.H.: The Relational Basis of Attitudes, Social Structures: A Network Approach, pp. 99–121. Cambridge University Press, Cambridge (1988)

    Google Scholar 

  7. Everett, M.G., Borgatti, S.P.: Role colouring a graph. Math. Soc. Sci. 21, 183–188 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gyárfás, A., Lehel, J.: On-line and first-fit colorings of graphs. J. Graph Theory 12, 217–227 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hell, P., Nešetřil, J.: On the complexity of H-colouring. J. Comb. Theory, Ser. B 48, 92–110 (1990)

    Article  MATH  Google Scholar 

  10. Hummon, N., Carley, K.: Social networks as normal science. Soc. Netw. 15, 71–106 (1993)

    Article  Google Scholar 

  11. Kierstead, H.A.: Coloring graphs on-line. In: Online Algorithms: The State of The Art. Lecture Notes in Computer Science, vol. 1442, pp. 281–305. Springer, Berlin (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering and Computing Sciences, Durham University, Science Laboratories, South Road, Durham, DH1 3LE, UK

    Matthew Johnson & Daniël Paulusma

  2. School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK

    Viresh Patel

  3. École Normale Supérieure de Lyon, 46 Allée d’Italie, 69364, Lyon Cedex 07, France

    Théophile Trunck

Authors
  1. Matthew Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Viresh Patel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniël Paulusma
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Théophile Trunck
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Viresh Patel.

Additional information

M. Johnson supported by EPSRC Grant EP/E048374/1. V. Patel supported by EPSRC Grant EP/F064551/1. D. Paulusma supported by EPSRC Grant EP/G043434/1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Johnson, M., Patel, V., Paulusma, D. et al. Obtaining Online Ecological Colourings by Generalizing First-Fit. Theory Comput Syst 54, 244–260 (2014). https://doi.org/10.1007/s00224-013-9513-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-013-9513-9

Keywords

Search

Navigation