Mahdad Khatirinejad

According to our database, Mahdad Khatirinejad authored at least 11 papers between 2005 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

A Note on the Roman Bondage Number of Planar Graphs.

Saieed Akbari, Mahdad Khatirinejad, Sahar Qajar

Graphs Comb., 2013

2012

Vertex-colouring edge-weightings with two edge weights.

Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens

Discret. Math. Theor. Comput. Sci., 2012

Steiner triple systems satisfying the 4-vertex condition.

Petteri Kaski, Mahdad Khatirinejad, Patric R. J. Östergård

Des. Codes Cryptogr., 2012

2011

Digraphs are 2-Weight Choosable.

Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens

Electron. J. Comb., 2011

2010

A census of one-factorizations of the complete 3-uniform hypergraph of order 9.

Mahdad Khatirinejad, Patric R. J. Östergård

Australas. J Comb., 2010

2009

Linear codes for high payload steganography.

Mahdad Khatirinejad, Petr Lisonek

Discret. Appl. Math., 2009

2008

Planarity of iterated line graphs.

Mohammad Ghebleh, Mahdad Khatirinejad

Discret. Math., 2008

2006

Erratum for "A Family of Complete Caps in PG(<i>n</i>, 2)".

Petr Lisonek, Mahdad Khatirinejad

Des. Codes Cryptogr., 2006

Classification and Constructions of Complete Caps in Binary Spaces.

Mahdad Khatirinejad, Petr Lisonek

Des. Codes Cryptogr., 2006

2005

IC-Colorings and IC-Indices of graphs.

Ebrahim Salehi, Sin-Min Lee, Mahdad Khatirinejad

Discret. Math., 2005

A Family of Complete Caps in PG(<i>n</i>, 2).

Petr Lisonek, Mahdad Khatirinejad

Des. Codes Cryptogr., 2005