Get access
Check if you have access via personal or institutional login
Log in Register
• Cited by 6
• Cited by

  • 6

  Crossref Citations

  

  This chapter has been cited by the following publications. This list is generated based on data provided by CrossRef.

  ---

  Bollobás, B. and Scott, A. D. 2002. Problems and results on judicious partitions. Random Structures & Algorithms, Vol. 21, Issue. 3-4, p. 414.

  • CrossRef
  • Google Scholar

  ---

  Bruhn, Henning Diestel, Reinhard Georgakopoulos, Agelos and Sprüssel, Philipp 2010. Every rayless graph has an unfriendly partition. Combinatorica, Vol. 30, Issue. 5, p. 521.

  • CrossRef
  • Google Scholar

  ---

  Kun, Jeremy Powers, Brian and Reyzin, Lev 2013. Algorithmic Game Theory. Vol. 8146, Issue. , p. 122.

  • CrossRef
  • Google Scholar

  ---

  Haynes, Teresa W. Hedetniemi, Stephen T. and Vasylieva, Inna 2015. Very cost effective bipartitions in graphs. AKCE International Journal of Graphs and Combinatorics, Vol. 12, Issue. 2-3, p. 155.

  • CrossRef
  • Google Scholar

  ---

  Haynes, Teresa W. Hedetniemi, Stephen T. McCoy, Tabitha L. and Rodriguez, Tony K. 2016. Bounds on cost effective domination numbers. Quaestiones Mathematicae, Vol. 39, Issue. 6, p. 773.

  • CrossRef
  • Google Scholar

  ---

  Conley, Clinton T. and Tamuz, Omer 2020. Unfriendly colorings of graphs with finite average degree. Proceedings of the London Mathematical Society,

  • CrossRef
  • Google Scholar

  ---

  ×

• Print publication year: 1990
• Online publication date: March 2012

Graphs with no unfriendly partitions

• By Saharon Shelah, The Hebrew University, E. C. Milner, University of Calgary
• Edited by A. Baker, Trinity College, Cambridge, B. Bollobás, Trinity College, Cambridge, A. Hajnal
• Publisher: Cambridge University Press
• DOI: https://doi.org/10.1017/CBO9780511983917.031
• pp 373-384