A general position problem in graph theory

Authors

  • P. Manuel College of Computing Sciences & Engineering Kuwait University Kuwait
  • S. Klavzar Faculty of Mathematics and Physics, University of Ljubljana, Slovenia

Keywords:

general position problem, isometric subgraph, packing, independence number, computational complexity

Abstract

DOI: 10.1017/S0004972718000473

Author Biography

P. Manuel, College of Computing Sciences & Engineering Kuwait University Kuwait

Prof. Paul D. Manuel is Professor in Information Science at Kuwait University. He received his M.S in Computer Science from the University of Saskatchewan, Canada in 1992. He obtained his Ph. D in Computer Science from the University of Newcastle, Australia in 1996. He got his first PhD in computing from Indian Institute of Technology, India in 1986. His current research interests are in Graph Algorithms and Computational Complexity. His publications have been cited over 1000 times. He has published more than over 100 scientific papers in peer reviewed journals with a total impact factor exceeding 60.

Published

2018-08-10

Issue

Section

Articles