Advanced search
Publication Cover
AKCE International Journal of Graphs and Combinatorics Volume 21, 2024 - Issue 1
Submit an article Journal homepage
299
Views
0
CrossRef citations to date
0
Altmetric
Articles

Tolerant Radon partitions on the all-paths convexity in graphs

Sreekumar Sreedharana Department of Mathematics, Government College for Women, Thiruvananthapuram, India;b Department of Futures Studies, University of Kerala, Thiruvananthapuram, India
&
Manoj Changatb Department of Futures Studies, University of Kerala, Thiruvananthapuram, IndiaCorrespondence[email protected]
Pages 11-15 | Received 08 May 2023, Accepted 02 Jul 2023, Published online: 21 Jul 2023

References

  • Balakrishnan, K., Changat, M. (2008). Hull numbers of path convexities on graphs. In: Joint Proceedings of the International Instructional Workshop on Convexity in Discrete Structures, Ramanujan Mathematical Society, 5, pp. 11–23.
  • Bereg, S., Haghpanah, M. (2022). Algorithms for Radon partition with tolerance. Discrete Appl. Math. 319: 207–215.
  • Buckley, F, Harary, F. (1990). Distance in Graphs. Redwood City, CA: Addison-Wesley Publishing Company.
  • Changat, M., Mulder, H. M., Sierksma, G. (2005). Covexities related to path properties on graphs. Discrete Math. 290: 117–131.
  • Changat, M., Klavzar, S., Mulder, H. M. (2001). The all-paths transit function of a graph. Czechoslovak Math. J. 51: 439–448.
  • Changat, M., Mathew, J. (1999). On triangle path convexity in graphs. Discrete Math. 206: 91–95.
  • Duchet, P. (1999). Discrete convexity: retractions, morphisms and the partition problem. In: Proceedings of the Conference on Graph Connections (Cochin, January 28–31. 1998). New Delhi: Allied Pub, pp. 10–18.
  • Duchet, P. (1988). Convex sets in graphs II, Minimal path convexity. J. Comb. Theory Ser. B 44: 307–316.
  • Duchet, P. (1987). Convexity in combinatorial structures. In: Proceedings of the Fourteenth Winter School on Abstract Analysis, Circolo Matematico di Palermo, pp. 261–293.
  • Garcia-Colin, N. (2007). Applying Tverberg type theorems to geometric problems. Ph. D. Thesis. University College of London.
  • Kay, D. C., Womble, E. W. (1971). Axiomatic convexity theory and relationships between the Caratheodory, Helly and Radon numbers. Pac. J. Math. 38(2): 471–485.
  • Larman, D. G. (1972). On sets projectively equivalent to the vertices of a convex polytope. Bull. London Math. Soc. 4(1): 6–12.
  • Mulder, H. M. (2008). Transit functions on graphs(and posets). In: Joint Proceedings of the International Instructional Workshop on Convexity in Discrete Structures, Ramanujan Mathematical Society, 5, pp. 117–130.
  • Radon, J. (1921). Mengen konvexer korper, die einen gemeinsamen Punkt enthalten. Math.Ann. 83: 113–115.
  • Sampathkumar, E. (1984). Convex sets in graphs. Indian J. Pure Appl. Math. 15:1065–1071.
  • Sierksma, G. (1975). Caratheodory and Helly numbers of convex product structures. Pac. J. Math. 61:275–282.
  • Sierksma, G. (1976). Axiomatic theory and convex product space. Ph. D. Thesis, University of Groningen.
  • Sierksma, G. (1977). Relationships between Caratheodory, Helly, Radon and Exchange numbers of convexity spaces. Nieuw Archief voor Wiskunde 3(25): 115–132.
  • Soberon, P., Strausz, R. (2012). A Generalisation of Tverberg’s theorem. Discrete Comput. Geom. 47(3): 455–460.
  • Tverberg, H. (1966). A generalization of Radon’s theorem. J. London Math. Soc. 1(1): 123–128.
  • Van de Vel, M. L. J. (1993). Theory of Convex Structures. Amsterdam: North Holland Mathematical Library.
  • West, D. B. (2002). Introduction to Graph Theory. Singapore: Pearson Education.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.