Italo J. Dejter

According to our database, Italo J. Dejter authored at least 33 papers between 1988 and 2021.

Collaborative distances:

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

2021

A numeral system for the middle-levels graphs.

Italo J. Dejter

Electron. J. Graph Theory Appl., 2021

Homogeneous edge-disjoint $K_{2s}$ and $T_{st, t}$ unions.

Italo J. Dejter

Australas. J Comb., 2021

2020

On coloring the arcs of biregular graphs.

Italo J. Dejter

Discret. Appl. Math., 2020

2018

Rainbow perfect domination in lattice graphs.

Luis R. Fuentes, Italo J. Dejter, Carlos A. Araújo

Electron. J. Graph Theory Appl., 2018

There is but one PDS in ℤ³ inducing just square components.

Italo J. Dejter, Luis R. Fuentes, Carlos A. Araújo

Bull. ICA, 2018

2017

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

2015

Rainbow tetrahedra in Cayley graphs.

Italo J. Dejter

Discuss. Math. Graph Theory, 2015

2014

Lattice-like perfect codes.

Carlos A. Araújo, Italo J. Dejter

Discuss. Math. Graph Theory, 2014

A generalization of Lee codes.

Carlos A. Araújo, Italo J. Dejter, Peter Horák

Des. Codes Cryptogr., 2014

2013

Worst-case efficient dominating sets in digraphs.

Italo J. Dejter

Discret. Appl. Math., 2013

Orienting and separating distance-transitive graphs.

Italo Jose Dejter

Ars Math. Contemp., 2013

2012

From the Coxeter Graph to the Klein Graph.

Italo J. Dejter

J. Graph Theory, 2012

2011

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

2010

On a C₄-ultrahomogeneous oriented graph.

Italo J. Dejter

Discret. Math., 2010

Corrigendum to: On a {K₄, K_{2, 2, 2}}-ultrahomogeneous graph.

Italo J. Dejter

Australas. J Comb., 2010

2009

Quasiperfect domination in triangular lattices.

Italo J. Dejter

Discuss. Math. Graph Theory, 2009

SQS-graphs of Solov'eva-Phelps codes

Italo J. Dejter

CoRR, 2009

SQS-graph of Solov'eva-Phelps codes

Italo J. Dejter

CoRR, 2009

On {K₄, K_{2, 2, 2}} ultrahomogeneity.

Italo J. Dejter

Australas. J Comb., 2009

2008

Perfect domination in regular grid graphs.

Italo J. Dejter

Australas. J Comb., 2008

2005

STS-graphs of perfect codes mod kernel.

Italo J. Dejter, Abel A. Delgado

Discret. Math., 2005

2003

Equitable factorizations of Hamming shells.

Italo J. Dejter

Discret. Math., 2003

Efficient dominating sets in Cayley graphs.

Italo J. Dejter, Oriol Serra

Discret. Appl. Math., 2003

2000

The number of 4-cycles in 2-factorizations of <i>K</i>_2n minus a 1-factor.

Peter Adams, Elizabeth J. Billington, Italo J. Dejter, Charles Curtis Lindner

Discret. Math., 2000

1999

Ternary Hamming and binary perfect covering codes.

Italo J. Dejter, Kevin T. Phelps

Proceedings of the Codes and Association Schemes, 1999

1998

Hidden Cayley graph structures.

Italo J. Dejter, Héctor Hevia, Oriol Serra

Discret. Math., 1998

The directed almost resolvable Hamilton-Waterloo problem.

Italo J. Dejter, David A. Pike, Christopher A. Rodger

Australas. J Comb., 1998

1997

Triangles in 2-factorizations.

Italo J. Dejter, Frantisek Franek, Eric Mendelsohn, Alexander Rosa

J. Graph Theory, 1997

1996

TMC tetrahedral types MOD 2<i>k</i> + 1 and their structure graphs.

Italo J. Dejter

Graphs Comb., 1996

1994

On symmetric subgraphs of the 7-cube: an overview.

Italo J. Dejter

Discret. Math., 1994

1993

A note on frucht diagrams, boolean graphs and hamilton cycles.

Italo J. Dejter, Walter Cedeño, V. Jauregui

Discret. Math., 1993

1992

Recognizing the Hidden Structure of Cayley Graphs.

Italo J. Dejter

Proceedings of the Computational Support for Discrete Mathematics, 1992

1988

Two hamilton cycles in bipartite reflective kneser graphs.

Italo J. Dejter, J. Cordova, J. A. Quintana

Discret. Math., 1988