Two hamilton cycles in bipartite reflective kneser graphs. - Italo J. Dejter; J. Cordova; J. A. Quintana (Discret. Math., 1988)

Recognizing the Hidden Structure of Cayley Graphs. - Italo J. Dejter (Computational Support for Discrete Mathematics, 1992)

A note on frucht diagrams, boolean graphs and hamilton cycles. - Italo J. Dejter; Walter Cedeño; V. Jauregui (Discret. Math., 1993)

On symmetric subgraphs of the 7-cube: an overview. - Italo J. Dejter (Discret. Math., 1994)

TMC tetrahedral types MOD 2k + 1 and their structure graphs. - Italo J. Dejter (Graphs Comb., 1996)

Triangles in 2-factorizations. - Italo J. Dejter; Frantisek Franek; Eric Mendelsohn; Alexander Rosa (J. Graph Theory, 1997)

The directed almost resolvable Hamilton-Waterloo problem. - Italo J. Dejter; David A. Pike; Christopher A. Rodger (Australas. J Comb., 1998)

Hidden Cayley graph structures. - Italo J. Dejter; Héctor Hevia; Oriol Serra (Discret. Math., 1998)

Ternary Hamming and binary perfect covering codes. - Italo J. Dejter; Kevin T. Phelps (Codes and Association Schemes, 1999)

The number of 4-cycles in 2-factorizations of K2n minus a 1-factor. - Peter Adams 001; Elizabeth J. Billington; Italo J. Dejter; Charles Curtis Lindner (Discret. Math., 2000)

Efficient dominating sets in Cayley graphs. - Italo J. Dejter; Oriol Serra (Discret. Appl. Math., 2003)

Equitable factorizations of Hamming shells. - Italo J. Dejter (Discret. Math., 2003)

STS-graphs of perfect codes mod kernel. - Italo J. Dejter; Abel A. Delgado (Discret. Math., 2005)

Perfect domination in regular grid graphs. - Italo J. Dejter (Australas. J Comb., 2008)

On {K4, K2, 2, 2} ultrahomogeneity. - Italo J. Dejter (Australas. J Comb., 2009)

SQS-graph of Solov'eva-Phelps codes - Italo J. Dejter (CoRR, 2009)

SQS-graphs of Solov'eva-Phelps codes - Italo J. Dejter (CoRR, 2009)

Quasiperfect domination in triangular lattices. - Italo J. Dejter (Discuss. Math. Graph Theory, 2009)

Corrigendum to: On a {K4, K2, 2, 2}-ultrahomogeneous graph. - Italo J. Dejter (Australas. J Comb., 2010)

On a C4-ultrahomogeneous oriented graph. - Italo J. Dejter (Discret. Math., 2010)

Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles. - Elizabeth J. Billington; Italo J. Dejter; Dean G. Hoffman; Charles Curtis Lindner (Graphs Comb., 2011)

From the Coxeter Graph to the Klein Graph. - Italo J. Dejter (J. Graph Theory, 2012)

Orienting and separating distance-transitive graphs. - Italo Jose Dejter (Ars Math. Contemp., 2013)

Worst-case efficient dominating sets in digraphs. - Italo J. Dejter (Discret. Appl. Math., 2013)

A generalization of Lee codes. - Carlos A. Araújo; Italo J. Dejter; Peter Horák (Des. Codes Cryptogr., 2014)

Lattice-like perfect codes. - Carlos A. Araújo; Italo J. Dejter (Discuss. Math. Graph Theory, 2014)

Rainbow tetrahedra in Cayley graphs. - Italo J. Dejter (Discuss. Math. Graph Theory, 2015)

Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3. - Italo J. Dejter; Oscar Tomaiconza (Discret. Appl. Math., 2017)

There is but one PDS in ℤ3 inducing just square components. - Italo J. Dejter; Luis R. Fuentes; Carlos A. Araújo (Bull. ICA, 2018)

Rainbow perfect domination in lattice graphs. - Luis R. Fuentes; Italo J. Dejter; Carlos A. Araújo (Electron. J. Graph Theory Appl., 2018)

On coloring the arcs of biregular graphs. - Italo J. Dejter (Discret. Appl. Math., 2020)

Homogeneous edge-disjoint $K_{2s}$ and $T_{st, t}$ unions. - Italo J. Dejter (Australas. J Comb., 2021)

A numeral system for the middle-levels graphs. - Italo J. Dejter (Electron. J. Graph Theory Appl., 2021)

An Alternate Form of Merino-Mǐcka-Mütze's Solution to a Knuth's Combinatorial Generation Problem. - Italo J. Dejter (Ars Comb., 2024)

Total Coloring and Efficient Domination Applications to Non-Cayley Non-Shreier Vertex-transitive Graphs. - Italo J. Dejter (Ars Comb., 2024)

Total coloring of regular graphs of girth = degree + 1. - Italo J. Dejter (Ars Comb., 2025)