Follow
Qays Rashid Shakir
Qays Rashid Shakir
Middle Technical Univeristy
Verified email at mtu.edu.iq
Title
Cited by
Cited by
Year
Minimal and Maximal Beta Open Sets
QR Shakir
Al-Nahrain Journal of Science 17 (1), 160-166, 2014
42014
Topological inductive constructions for tight surface graphs
J Cruickshank, D Kitson, SC Power, Q Shakir
Graphs and Combinatorics 38 (6), 169, 2022
22022
Topological constructions for tight surface graphs
J Cruickshank, D Kitson, SC Power, Q Shakir
arXiv preprint arXiv:1909.06545, 2019
22019
On Vietoris Soft Topology I.
QR Shakir
Journal of Scientific Research 8 (1), 2016
22016
Polygon Representations of Surface Graphs
QR Shakir
Vietnam Journal of Mathematics, 1-9, 2023
12023
On setwise betweenness
QR Shakir
Applied General Topology 24 (1), 115-123, 2023
12023
Minimal and Maximal Soft Open Sets
Q Shakir
Malaya Journal of Matematik (MJM) 4 (1, 2016), 53-58, 2016
12016
Minimal and Maximal Feebly Open Sets
Q Shakir
Iraqi Journal of Science 54 (4), 934-943, 2013
12013
Rotation systems of some topological graph operations
QR Shakir
AIP Conference Proceedings 3036 (1), 2024
2024
On Leaved Dipole Rose Spherical, Cylindrical and Torus Graphs.
QR Shakir
Engineering Letters 31 (2), 2023
2023
Contacts of Circular Arcs Representations of Tight Surface Graphs
QS James Curickshank
28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16 …, 2020
2020
Sparse surface graphs
QR Shakir
NUI Galway, 2019
2019
Sparsity and Tightness for Graphs Drawn on Surfaces
Q Shakir
2017
Degrees of Freedom in Rigidity Theory
Q Shakir
2017
New Types of Minimal and Maximal Sets via Preopen Sets
QR Shakir
Al-Mustansiriyah Journal of Science 24 (5), 2013
2013
On Feebly Door spaces
QR Shakir
Al-Mustansiriyah Journal of Science 23 (6), 2012
2012
Tightness of Surface Graphs
Q Shakir
Contacts of Circular Arcs Representations of Tight Surface Graphs
J Cruickshank, Q Shakir
On Some Kinds of Contact Graphs
Q Shakir
Building Sparse Graphs by Inductive Operations
Q Shakir
The system can't perform the operation now. Try again later.
Articles 1–20