Mulder, H.M.: The majority strategy on graphs. McMorris, F.R., Roberts, F.S., Wang, C.: The center function on trees. World Scientific (2011) Google Scholar 15. In: Advances in Interdisciplinary Applied Discrete Mathematics, pp. McMorris, F.R., Mulder, H.M., Vohra, R.V.: Axiomatic characterization of location functions. McMorris, F.R., Mulder, H.M., Roberts, F.S.: The median procedure on median graphs. McMorris, F.R., Mulder, H.M., Ortega, O.: The ℓ? -function on trees. McMorris, F.R., Mulder, H.M., Ortega, O.: Axiomatic characterization of the mean function on trees.
McMorris, F., Neumann, D.: Consensus functions defined on trees. Klavzar, S., Mulder, H.M.: Median graphs: characterizations, location theory and related structures. Kemeny, J.G., Snell, L.: Preference ranking: an axiomatic approach. Holzman, R.: An axiomatic approach to location on networks. Hagauer, J.: Skeletons, recognition algorithm and distance matrix of quasi-median graphs. Changat, M., Lekha, D.S., Mohandas, S., Mulder, H.M., Subhamathi, A.R.: Axiomatic characterization of the median and antimedian function on a complete graph minus a matching.
Graph Theory 18(7), 681–703 (1994) MathSciNetCrossRefGoogle Scholar 5. Bandelt, H.J., Mulder, H.M., Wilkeit, E.: Quasi-median graphs and algebras. Bandelt, H.J., Chepoi, V.: Graphs with connected medians. Balakrishnan, K., Changat, M., Mulder, H.M.: The plurality strategy on graphs. Yale University Press, London (2012) zbMATHGoogle Scholar 2.
Arrow, K.J.: Social Choice and Individual Values, vol. Prentice-Hall of India Private Limited (2005) 1. West, D.B.: Introduction to Graph Theory. Wagon, S.: A bound on the chromatic number of graphs without certain induced subgraphs. Schiermeyer, I., Randerath, B.: Polynomial ? -binding functions and forbidden induced subgraphs: a survey. Randerath, B., Schiermeyer, I.: Vertex colouring and forbidden subgraphs-a survey. Karthick, T., Mishra, S.: Chromatic bounds for some classes of 2?2 -free graphs. Karthick, T., Maffray, F.: Vizing bound for the chromatic number on some graph classes. Zastosowania Matematyki Applicationes Mathematicae 19(3–4), 413–441 (1987) MathSciNetCrossRefGoogle Scholar 8. Gyárfás, A.: Problems from the world surrounding perfect graphs. Gaspers, S., Huang, S.: ( 2?2,?4 )-free graphs are 4 -colorable. Fouquet, J.L., Giakoumakis, V., Maire, F., Thuillier, H.: On graphs without ?5 and ?5⎯⎯⎯⎯⎯⎯. Brause, C., Randerath, B., Schiermeyer, I., Vumar, E.: On the chromatic number of 2?2 -free graphs. Brandt, S.: Triangle-free graphs and forbidden subgraphs. Blázsik, Z., Hujter, M., Pluhár, A., Tuza, Z.: Graphs with no induced ?4 and 2?2. Bharathi, A.P., Choudum, S.A.: Colouring of ( ?3∪?2 )-free graphs. Deductive Reasoning, Cultural Fit, Inclusion Principles, Big Data Systems - 1.