default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDItalo J. Dejter
Person information
- affiliation: University of Puerto Rico, Department of Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j29]Italo J. Dejter:
Homogeneous edge-disjoint $K_{2s}$ and $T_{st, t}$ unions. Australas. J Comb. 81: 101-125 (2021)- [j28]Italo J. Dejter:
A numeral system for the middle-levels graphs. Electron. J. Graph Theory Appl. 9(1): 137-156 (2021) - 2020
- [j27]Italo J. Dejter
:
On coloring the arcs of biregular graphs. Discret. Appl. Math. 284: 489-498 (2020)
2010 – 2019
- 2018
- [j26]Italo J. Dejter, Luis R. Fuentes, Carlos A. Araújo:
There is but one PDS in ℤ3 inducing just square components. Bull. ICA 82: 30-41 (2018) - [j25]Luis R. Fuentes, Italo J. Dejter, Carlos A. Araújo:
Rainbow perfect domination in lattice graphs. Electron. J. Graph Theory Appl. 6(1): 95-112 (2018) - 2017
- [j24]Italo J. Dejter, Oscar Tomaiconza:
Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3. Discret. Appl. Math. 232: 116-124 (2017) - 2015
- [j23]Italo J. Dejter:
Rainbow tetrahedra in Cayley graphs. Discuss. Math. Graph Theory 35(4): 733-754 (2015) - 2014
- [j22]Carlos A. Araújo, Italo J. Dejter, Peter Horák:
A generalization of Lee codes. Des. Codes Cryptogr. 70(1-2): 77-90 (2014) - [j21]Carlos A. Araújo, Italo J. Dejter:
Lattice-like perfect codes. Discuss. Math. Graph Theory 34(1): 57-74 (2014) - 2013
- [j20]Italo Jose Dejter:
Orienting and separating distance-transitive graphs. Ars Math. Contemp. 6(2): 221-236 (2013) - [j19]Italo J. Dejter:
Worst-case efficient dominating sets in digraphs. Discret. Appl. Math. 161(7-8): 944-952 (2013) - 2012
- [j18]Italo J. Dejter:
From the Coxeter Graph to the Klein Graph. J. Graph Theory 70(1): 1-9 (2012) - [i5]Italo J. Dejter:
Worst-case efficient dominating sets in digraphs. CoRR abs/1201.1728 (2012) - [i4]Carlos A. Araújo, Italo J. Dejter, Peter Horák:
A Generalization of Lee Codes. CoRR abs/1210.5863 (2012) - 2011
- [j17]Elizabeth J. Billington, Italo J. Dejter, Dean G. Hoffman, Charles Curtis Lindner:
Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles. Graphs Comb. 27(2): 161-170 (2011) - 2010
- [j16]Italo J. Dejter:
Corrigendum to: On a {K4, K2, 2, 2}-ultrahomogeneous graph. Australas. J Comb. 46: 315- (2010) - [j15]Italo J. Dejter:
On a C4-ultrahomogeneous oriented graph. Discret. Math. 310(8): 1389-1391 (2010)
2000 – 2009
- 2009
- [j14]Italo J. Dejter:
On {K4, K2, 2, 2} ultrahomogeneity. Australas. J Comb. 44: 63-76 (2009) - [j13]Italo J. Dejter:
Quasiperfect domination in triangular lattices. Discuss. Math. Graph Theory 29(1): 179-198 (2009) - [i3]Italo J. Dejter:
Quasiperfect domination in triangular lattices. CoRR abs/0903.3685 (2009) - [i2]Italo J. Dejter:
SQS-graph of Solov'eva-Phelps codes. CoRR abs/0903.5049 (2009) - [i1]Italo J. Dejter:
SQS-graphs of Solov'eva-Phelps codes. CoRR abs/0905.3178 (2009) - 2008
- [j12]Italo J. Dejter:
Perfect domination in regular grid graphs. Australas. J Comb. 42: 99-114 (2008) - 2005
- [j11]Italo J. Dejter, Abel A. Delgado:
STS-graphs of perfect codes mod kernel. Discret. Math. 295(1-3): 31-47 (2005) - 2003
- [j10]Italo J. Dejter, Oriol Serra:
Efficient dominating sets in Cayley graphs. Discret. Appl. Math. 129(2-3): 319-328 (2003) - [j9]Italo J. Dejter:
Equitable factorizations of Hamming shells. Discret. Math. 261(1-3): 177-187 (2003) - 2000
- [j8]Peter Adams, Elizabeth J. Billington, Italo J. Dejter, Charles Curtis Lindner:
The number of 4-cycles in 2-factorizations of K2n minus a 1-factor. Discret. Math. 220(1-3): 1-11 (2000)
1990 – 1999
- 1999
- [c2]Italo J. Dejter, Kevin T. Phelps:
Ternary Hamming and binary perfect covering codes. Codes and Association Schemes 1999: 111-113 - 1998
- [j7]Italo J. Dejter, David A. Pike, Christopher A. Rodger:
The directed almost resolvable Hamilton-Waterloo problem. Australas. J Comb. 18: 201-208 (1998) - [j6]Italo J. Dejter, Héctor Hevia, Oriol Serra:
Hidden Cayley graph structures. Discret. Math. 182(1-3): 69-83 (1998) - 1997
- [j5]Italo J. Dejter, Frantisek Franek, Eric Mendelsohn, Alexander Rosa:
Triangles in 2-factorizations. J. Graph Theory 26(2): 83-94 (1997) - 1996
- [j4]Italo J. Dejter:
TMC tetrahedral types MOD 2k + 1 and their structure graphs. Graphs Comb. 12(1): 163-178 (1996) - 1994
- [j3]Italo J. Dejter:
On symmetric subgraphs of the 7-cube: an overview. Discret. Math. 124(1-3): 55-66 (1994) - 1993
- [j2]Italo J. Dejter, Walter Cedeño, V. Jauregui:
A note on frucht diagrams, boolean graphs and hamilton cycles. Discret. Math. 114(1-3): 131-135 (1993) - 1992
- [c1]Italo J. Dejter:
Recognizing the Hidden Structure of Cayley Graphs. Computational Support for Discrete Mathematics 1992: 379-389
1980 – 1989
- 1988
- [j1]Italo J. Dejter, J. Cordova, J. A. Quintana:
Two hamilton cycles in bipartite reflective kneser graphs. Discret. Math. 72(1-3): 63-70 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
