Italo J. Dejter

38 papers Journal 36Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Total coloring of regular graphs of girth = degree + 1.
Ars Comb.
Italo J. Dejter
2024 J jnl
An Alternate Form of Merino-Mǐcka-Mütze's Solution to a Knuth's Combinatorial Generation Problem.
Ars Comb.
Italo J. Dejter
2024 J jnl
Total Coloring and Efficient Domination Applications to Non-Cayley Non-Shreier Vertex-transitive Graphs.
Ars Comb.
Italo J. Dejter
2021 J jnl
A numeral system for the middle-levels graphs.
Electron. J. Graph Theory Appl.
Italo J. Dejter
2021 J jnl
Homogeneous edge-disjoint $K_{2s}$ and $T_{st, t}$ unions.
Australas. J Comb.
Italo J. Dejter
2020 J jnl
On coloring the arcs of biregular graphs.
Discret. Appl. Math.
Italo J. Dejter
2018 J jnl
Rainbow perfect domination in lattice graphs.
Electron. J. Graph Theory Appl.
Luis R. Fuentes, Italo J. Dejter, Carlos A. Araújo
2018 J jnl
There is but one PDS in ℤ
Bull. ICA
Italo J. Dejter, Luis R. Fuentes, Carlos A. Araújo
2017 J jnl
Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3.
Discret. Appl. Math.
Italo J. Dejter, Oscar Tomaiconza
2015 J jnl
Rainbow tetrahedra in Cayley graphs.
Discuss. Math. Graph Theory
Italo J. Dejter
2014 J jnl
A generalization of Lee codes.
Des. Codes Cryptogr.
Carlos A. Araújo, Italo J. Dejter, Peter Horák
2014 J jnl
Lattice-like perfect codes.
Discuss. Math. Graph Theory
Carlos A. Araújo, Italo J. Dejter
2013 J jnl
Worst-case efficient dominating sets in digraphs.
Discret. Appl. Math.
Italo J. Dejter
2012 J jnl
A Generalization of Lee Codes
CoRR
Carlos A. Araújo, Italo J. Dejter, Peter Horák
2012 J jnl
From the Coxeter Graph to the Klein Graph.
J. Graph Theory
Italo J. Dejter
2012 J jnl
Worst-case efficient dominating sets in digraphs
CoRR
Italo J. Dejter
2011 J jnl
Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles.
Graphs Comb.
Elizabeth J. Billington, Italo J. Dejter, Dean G. Hoffman, Charles Curtis Lindner
2010 J jnl
Corrigendum to: On a {K
Australas. J Comb.
Italo J. Dejter
2010 J jnl
On a C
Discret. Math.
Italo J. Dejter
2009 J jnl
On {K
Australas. J Comb.
Italo J. Dejter
2009 J jnl
Quasiperfect domination in triangular lattices
CoRR
Italo J. Dejter
2009 J jnl
Quasiperfect domination in triangular lattices.
Discuss. Math. Graph Theory
Italo J. Dejter
2009 J jnl
SQS-graph of Solov'eva-Phelps codes
CoRR
Italo J. Dejter
2009 J jnl
SQS-graphs of Solov'eva-Phelps codes
CoRR
Italo J. Dejter
2008 J jnl
Perfect domination in regular grid graphs.
Australas. J Comb.
Italo J. Dejter
2005 J jnl
STS-graphs of perfect codes mod kernel.
Discret. Math.
Italo J. Dejter, Abel A. Delgado
2003 J jnl
Efficient dominating sets in Cayley graphs.
Discret. Appl. Math.
Italo J. Dejter, Oriol Serra
2003 J jnl
Equitable factorizations of Hamming shells.
Discret. Math.
Italo J. Dejter
2000 J jnl
The number of 4-cycles in 2-factorizations of
Discret. Math.
Peter Adams, Elizabeth J. Billington, Italo J. Dejter, Charles Curtis Lindner
1999 — conf
Ternary Hamming and binary perfect covering codes.
Codes and Association Schemes
Italo J. Dejter, Kevin T. Phelps
1998 J jnl
Hidden Cayley graph structures.
Discret. Math.
Italo J. Dejter, Héctor Hevia, Oriol Serra
1998 J jnl
The directed almost resolvable Hamilton-Waterloo problem.
Australas. J Comb.
Italo J. Dejter, David A. Pike, Christopher A. Rodger
1997 J jnl
Triangles in 2-factorizations.
J. Graph Theory
Italo J. Dejter, Frantisek Franek, Eric Mendelsohn, Alexander Rosa
1996 J jnl
TMC tetrahedral types MOD 2
Graphs Comb.
Italo J. Dejter
1994 J jnl
On symmetric subgraphs of the 7-cube: an overview.
Discret. Math.
Italo J. Dejter
1993 J jnl
A note on frucht diagrams, boolean graphs and hamilton cycles.
Discret. Math.
Italo J. Dejter, Walter Cedeño, V. Jauregui
1992 — conf
Recognizing the Hidden Structure of Cayley Graphs.
Computational Support for Discrete Mathematics
Italo J. Dejter
1988 J jnl
Two hamilton cycles in bipartite reflective kneser graphs.
Discret. Math.
Italo J. Dejter, J. Cordova, J. A. Quintana