Unilaterally connected large digraphs and generalized cycles

Gómez, José - Canale, Eduardo A. - Muñoz, Xavier

Resumen:

Lower and upper bounds on the order of digraphs and generalized p-cycles with a specified maximum degree and unilateral diameter are given for generic values of the parameters. Infinite families of digraphs attaining the bounds asymptotically or even exactly are presented. In particular, optimal results are proved for bipartite digraphs (p = 2) and digraphs with unilateral diameter 3.

Detalles Bibliográficos
2003
Trabajo financiado en parte por Consejo Superior de Investigaciones Científicas, España (Comisión Interministerial de Ciencia y Tecnología, CICYT), bajo proyectos TIC97-0963
Parcialmente financiado por CONICYT, Uruguay y el Instituto de Matemática y Estadística "Prof Ing Rafael Laguardia", Facultad de Ingeniería, Universidad de República
The (Δ,D)-problem
Unilaterally connected digraph
Moore diagraphs
Inglés
Universidad de la República
COLIBRI
https://hdl.handle.net/20.500.12008/51346
Acceso abierto
Licencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0)
_version_ 1875693217152761856
author Gómez, José
author2 Canale, Eduardo A.
Muñoz, Xavier
author2_role author
author
author_facet Gómez, José
Canale, Eduardo A.
Muñoz, Xavier
author_role author
bitstream.checksum.fl_str_mv 968751d126e0bff3c87106eb874398a2
6429389a7df7277b72b7924fdc7d47a9
a006180e3f5b2ad0b88185d14284c0e0
0feedbc93c9013cb52b8473c08f41376
3b50ae24bd8bd076d49a70878a8a2d2c
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
MD5
MD5
bitstream.url.fl_str_mv http://localhost:8080/xmlui/bitstream/20.500.12008/51346/16/GCM03.pdf
http://localhost:8080/xmlui/bitstream/20.500.12008/51346/15/license.txt
http://localhost:8080/xmlui/bitstream/20.500.12008/51346/12/license_url
http://localhost:8080/xmlui/bitstream/20.500.12008/51346/13/license_text
http://localhost:8080/xmlui/bitstream/20.500.12008/51346/14/license_rdf
collection COLIBRI
dc.contributor.filiacion.none.fl_str_mv Gómez José, Universitat Polit ecnica de Catalunya, Barcelona, Spain
Canale Eduardo A., Universidad de la República (Uruguay). Facultad de Ingeniería.
Muñoz Xavier, Universitat Politecnica de Catalunya, Barcelona, Spain
dc.creator.none.fl_str_mv Gómez, José
Canale, Eduardo A.
Muñoz, Xavier
dc.date.accessioned.none.fl_str_mv 2025-09-01T17:19:29Z
dc.date.available.none.fl_str_mv 2025-09-01T17:19:29Z
dc.date.issued.none.fl_str_mv 2003
dc.description.abstract.none.fl_txt_mv Lower and upper bounds on the order of digraphs and generalized p-cycles with a specified maximum degree and unilateral diameter are given for generic values of the parameters. Infinite families of digraphs attaining the bounds asymptotically or even exactly are presented. In particular, optimal results are proved for bipartite digraphs (p = 2) and digraphs with unilateral diameter 3.
dc.description.sponsorship.none.fl_txt_mv Trabajo financiado en parte por Consejo Superior de Investigaciones Científicas, España (Comisión Interministerial de Ciencia y Tecnología, CICYT), bajo proyectos TIC97-0963
Parcialmente financiado por CONICYT, Uruguay y el Instituto de Matemática y Estadística "Prof Ing Rafael Laguardia", Facultad de Ingeniería, Universidad de República
dc.format.extent.es.fl_str_mv 8 p.
dc.format.mimetype.es.fl_str_mv application/pdf
dc.identifier.citation.es.fl_str_mv Gómez, J., Canale, E. y Muñoz, X. Unilaterally connected large digraphs and generalized cycles [Preprint]. Publicado en: Networks, 2003, vol. 42, no. 4, pp. 181-188. DOI: 10.1002/net.10095.
dc.identifier.uri.none.fl_str_mv https://hdl.handle.net/20.500.12008/51346
dc.language.iso.none.fl_str_mv en
eng
dc.rights.license.none.fl_str_mv Licencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0)
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
dc.source.none.fl_str_mv reponame:COLIBRI
instname:Universidad de la República
instacron:Universidad de la República
dc.subject.es.fl_str_mv The (Δ,D)-problem
Unilaterally connected digraph
Moore diagraphs
dc.title.none.fl_str_mv Unilaterally connected large digraphs and generalized cycles
dc.type.es.fl_str_mv Preprint
dc.type.none.fl_str_mv info:eu-repo/semantics/preprint
dc.type.version.none.fl_str_mv info:eu-repo/semantics/submittedVersion
description Lower and upper bounds on the order of digraphs and generalized p-cycles with a specified maximum degree and unilateral diameter are given for generic values of the parameters. Infinite families of digraphs attaining the bounds asymptotically or even exactly are presented. In particular, optimal results are proved for bipartite digraphs (p = 2) and digraphs with unilateral diameter 3.
eu_rights_str_mv openAccess
format preprint
id COLIBRI_ee409a5ee3b86be476994bbbb5da9c80
identifier_str_mv Gómez, J., Canale, E. y Muñoz, X. Unilaterally connected large digraphs and generalized cycles [Preprint]. Publicado en: Networks, 2003, vol. 42, no. 4, pp. 181-188. DOI: 10.1002/net.10095.
instacron_str Universidad de la República
institution Universidad de la República
instname_str Universidad de la República
language eng
language_invalid_str_mv en
network_acronym_str COLIBRI
network_name_str COLIBRI
oai_identifier_str oai:colibri.udelar.edu.uy:20.500.12008/51346
publishDate 2003
reponame_str COLIBRI
repository.mail.fl_str_mv karina.camps@seciu.edu.uy
repository.name.fl_str_mv COLIBRI - Universidad de la República
repository_id_str 4771
rights_invalid_str_mv Licencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0)
spelling Gómez José, Universitat Polit ecnica de Catalunya, Barcelona, SpainCanale Eduardo A., Universidad de la República (Uruguay). Facultad de Ingeniería.Muñoz Xavier, Universitat Politecnica de Catalunya, Barcelona, Spain2025-09-01T17:19:29Z2025-09-01T17:19:29Z2003Gómez, J., Canale, E. y Muñoz, X. Unilaterally connected large digraphs and generalized cycles [Preprint]. Publicado en: Networks, 2003, vol. 42, no. 4, pp. 181-188. DOI: 10.1002/net.10095.https://hdl.handle.net/20.500.12008/51346Lower and upper bounds on the order of digraphs and generalized p-cycles with a specified maximum degree and unilateral diameter are given for generic values of the parameters. Infinite families of digraphs attaining the bounds asymptotically or even exactly are presented. In particular, optimal results are proved for bipartite digraphs (p = 2) and digraphs with unilateral diameter 3.Submitted by Ribeiro Jorge (jribeiro@fing.edu.uy) on 2025-04-08T21:10:28Z No. of bitstreams: 2 license_rdf: 26539 bytes, checksum: 3b50ae24bd8bd076d49a70878a8a2d2c (MD5) GCM03.pdf: 479551 bytes, checksum: dad586a7b9d938947d4b8bc9f0784904 (MD5)Rejected by Machado Jimena (jmachado@fing.edu.uy), reason: Jorge! sabes que cuando abro el archivo, lo veo aro, como descompaginado. te animas a adjuntarlo de nuevo? gracias on 2025-04-23T14:30:42Z (GMT)Submitted by Ribeiro Jorge (jribeiro@fing.edu.uy) on 2025-04-23T18:21:04Z No. of bitstreams: 2 license_rdf: 26539 bytes, checksum: 3b50ae24bd8bd076d49a70878a8a2d2c (MD5) GCM03.pdf: 150184 bytes, checksum: c38956da958108dad80942fadb59de85 (MD5)Rejected by Machado Jimena (jmachado@fing.edu.uy), reason: jorge, cambia el pdf por el preprint que está disponible para descargar, aunque se vea feo. te lo mando ahora por mail, por si no lo tenes. on 2025-09-01T15:21:53Z (GMT)Submitted by Ribeiro Jorge (jribeiro@fing.edu.uy) on 2025-09-01T16:05:52Z No. of bitstreams: 2 license_rdf: 26539 bytes, checksum: 3b50ae24bd8bd076d49a70878a8a2d2c (MD5) GCM03.pdf: 479551 bytes, checksum: dad586a7b9d938947d4b8bc9f0784904 (MD5)Approved for entry into archive by Machado Jimena (jmachado@fing.edu.uy) on 2025-09-01T16:07:46Z (GMT) No. of bitstreams: 2 license_rdf: 26539 bytes, checksum: 3b50ae24bd8bd076d49a70878a8a2d2c (MD5) GCM03.pdf: 479551 bytes, checksum: dad586a7b9d938947d4b8bc9f0784904 (MD5)Made available in DSpace by Luna Fabiana (fabiana.luna@seciu.edu.uy) on 2025-09-01T17:19:29Z (GMT). No. of bitstreams: 2 license_rdf: 26539 bytes, checksum: 3b50ae24bd8bd076d49a70878a8a2d2c (MD5) GCM03.pdf: 479551 bytes, checksum: dad586a7b9d938947d4b8bc9f0784904 (MD5) Previous issue date: 2003Trabajo financiado en parte por Consejo Superior de Investigaciones Científicas, España (Comisión Interministerial de Ciencia y Tecnología, CICYT), bajo proyectos TIC97-0963Parcialmente financiado por CONICYT, Uruguay y el Instituto de Matemática y Estadística "Prof Ing Rafael Laguardia", Facultad de Ingeniería, Universidad de República8 p.application/pdfenengLas obras depositadas en el Repositorio se rigen por la Ordenanza de los Derechos de la Propiedad Intelectual de la Universidad de la República.(Res. Nº 91 de C.D.C. de 8/III/1994 – D.O. 7/IV/1994) y por la Ordenanza del Repositorio Abierto de la Universidad de la República (Res. Nº 16 de C.D.C. de 07/10/2014)info:eu-repo/semantics/openAccessLicencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0)The (Δ,D)-problemUnilaterally connected digraphMoore diagraphsUnilaterally connected large digraphs and generalized cyclesPreprintinfo:eu-repo/semantics/preprintinfo:eu-repo/semantics/submittedVersionreponame:COLIBRIinstname:Universidad de la Repúblicainstacron:Universidad de la RepúblicaGómez, JoséCanale, Eduardo A.Muñoz, XavierORIGINALGCM03.pdfGCM03.pdfapplication/pdf9451838http://localhost:8080/xmlui/bitstream/20.500.12008/51346/16/GCM03.pdf968751d126e0bff3c87106eb874398a2MD516LICENSElicense.txtlicense.txttext/plain; charset=utf-84267http://localhost:8080/xmlui/bitstream/20.500.12008/51346/15/license.txt6429389a7df7277b72b7924fdc7d47a9MD515CC-LICENSElicense_urllicense_urltext/plain; charset=utf-850http://localhost:8080/xmlui/bitstream/20.500.12008/51346/12/license_urla006180e3f5b2ad0b88185d14284c0e0MD512license_textlicense_texttext/html; charset=utf-829438http://localhost:8080/xmlui/bitstream/20.500.12008/51346/13/license_text0feedbc93c9013cb52b8473c08f41376MD513license_rdflicense_rdfapplication/rdf+xml; charset=utf-826539http://localhost:8080/xmlui/bitstream/20.500.12008/51346/14/license_rdf3b50ae24bd8bd076d49a70878a8a2d2cMD51420.500.12008/513462025-12-09 13:57:58.514oai:colibri.udelar.edu.uy:20.500.12008/51346VGVybWlub3MgeSBjb25kaWNpb25lcyByZWxhdGl2YXMgYWwgZGVwb3NpdG8gZGUgb2JyYXMKCgpMYXMgb2JyYXMgZGVwb3NpdGFkYXMgZW4gZWwgUmVwb3NpdG9yaW8gc2UgcmlnZW4gcG9yIGxhIE9yZGVuYW56YSBkZSBsb3MgRGVyZWNob3MgZGUgbGEgUHJvcGllZGFkIEludGVsZWN0dWFsICBkZSBsYSBVbml2ZXJzaWRhZCBEZSBMYSBSZXDDumJsaWNhLiAoUmVzLiBOwrogOTEgZGUgQy5ELkMuIGRlIDgvSUlJLzE5OTQg4oCTIEQuTy4gNy9JVi8xOTk0KSB5ICBwb3IgbGEgT3JkZW5hbnphIGRlbCBSZXBvc2l0b3JpbyBBYmllcnRvIGRlIGxhIFVuaXZlcnNpZGFkIGRlIGxhIFJlcMO6YmxpY2EgKFJlcy4gTsK6IDE2IGRlIEMuRC5DLiBkZSAwNy8xMC8yMDE0KS4gCgpBY2VwdGFuZG8gZWwgYXV0b3IgZXN0b3MgdMOpcm1pbm9zIHkgY29uZGljaW9uZXMgZGUgZGVww7NzaXRvIGVuIENPTElCUkksIGxhIFVuaXZlcnNpZGFkIGRlIFJlcMO6YmxpY2EgcHJvY2VkZXLDoSBhOiAgCgphKSBhcmNoaXZhciBtw6FzIGRlIHVuYSBjb3BpYSBkZSBsYSBvYnJhIGVuIGxvcyBzZXJ2aWRvcmVzIGRlIGxhIFVuaXZlcnNpZGFkIGEgbG9zIGVmZWN0b3MgZGUgZ2FyYW50aXphciBhY2Nlc28sIHNlZ3VyaWRhZCB5IHByZXNlcnZhY2nDs24KYikgY29udmVydGlyIGxhIG9icmEgYSBvdHJvcyBmb3JtYXRvcyBzaSBmdWVyYSBuZWNlc2FyaW8gIHBhcmEgZmFjaWxpdGFyIHN1IHByZXNlcnZhY2nDs24geSBhY2Nlc2liaWxpZGFkIHNpbiBhbHRlcmFyIHN1IGNvbnRlbmlkby4KYykgcmVhbGl6YXIgbGEgY29tdW5pY2FjacOzbiBww7pibGljYSB5IGRpc3BvbmVyIGVsIGFjY2VzbyBsaWJyZSB5IGdyYXR1aXRvIGEgdHJhdsOpcyBkZSBJbnRlcm5ldCBtZWRpYW50ZSBsYSBwdWJsaWNhY2nDs24gZGUgbGEgb2JyYSBiYWpvIGxhIGxpY2VuY2lhIENyZWF0aXZlIENvbW1vbnMgc2VsZWNjaW9uYWRhIHBvciBlbCBwcm9waW8gYXV0b3IuCgoKRW4gY2FzbyBxdWUgZWwgYXV0b3IgaGF5YSBkaWZ1bmRpZG8geSBkYWRvIGEgcHVibGljaWRhZCBhIGxhIG9icmEgZW4gZm9ybWEgcHJldmlhLCAgcG9kcsOhIHNvbGljaXRhciB1biBwZXLDrW9kbyBkZSBlbWJhcmdvIHNvYnJlIGxhIGRpc3BvbmliaWxpZGFkIHDDumJsaWNhIGRlIGxhIG1pc21hLCBlbCBjdWFsIGNvbWVuemFyw6EgYSBwYXJ0aXIgZGUgbGEgYWNlcHRhY2nDs24gZGUgZXN0ZSBkb2N1bWVudG8geSBoYXN0YSBsYSBmZWNoYSBxdWUgaW5kaXF1ZSAuCgpFbCBhdXRvciBhc2VndXJhIHF1ZSBsYSBvYnJhIG5vIGluZnJpZ2UgbmluZ8O6biBkZXJlY2hvIHNvYnJlIHRlcmNlcm9zLCB5YSBzZWEgZGUgcHJvcGllZGFkIGludGVsZWN0dWFsIG8gY3VhbHF1aWVyIG90cm8uCgpFbCBhdXRvciBnYXJhbnRpemEgcXVlIHNpIGVsIGRvY3VtZW50byBjb250aWVuZSBtYXRlcmlhbGVzIGRlIGxvcyBjdWFsZXMgbm8gdGllbmUgbG9zIGRlcmVjaG9zIGRlIGF1dG9yLCAgaGEgb2J0ZW5pZG8gZWwgcGVybWlzbyBkZWwgcHJvcGlldGFyaW8gZGUgbG9zIGRlcmVjaG9zIGRlIGF1dG9yLCB5IHF1ZSBlc2UgbWF0ZXJpYWwgY3V5b3MgZGVyZWNob3Mgc29uIGRlIHRlcmNlcm9zIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIHkgcmVjb25vY2lkbyBlbiBlbCB0ZXh0byBvIGNvbnRlbmlkbyBkZWwgZG9jdW1lbnRvIGRlcG9zaXRhZG8gZW4gZWwgUmVwb3NpdG9yaW8uCgpFbiBvYnJhcyBkZSBhdXRvcsOtYSBtw7psdGlwbGUgL3NlIHByZXN1bWUvIHF1ZSBlbCBhdXRvciBkZXBvc2l0YW50ZSBkZWNsYXJhIHF1ZSBoYSByZWNhYmFkbyBlbCBjb25zZW50aW1pZW50byBkZSB0b2RvcyBsb3MgYXV0b3JlcyBwYXJhIHB1YmxpY2FybGEgZW4gZWwgUmVwb3NpdG9yaW8sIHNpZW5kbyDDqXN0ZSBlbCDDum5pY28gcmVzcG9uc2FibGUgZnJlbnRlIGEgY3VhbHF1aWVyIHRpcG8gZGUgcmVjbGFtYWNpw7NuIGRlIGxvcyBvdHJvcyBjb2F1dG9yZXMuCgpFbCBhdXRvciBzZXLDoSByZXNwb25zYWJsZSBkZWwgY29udGVuaWRvIGRlIGxvcyBkb2N1bWVudG9zIHF1ZSBkZXBvc2l0YS4gTGEgVURFTEFSIG5vIHNlcsOhIHJlc3BvbnNhYmxlIHBvciBsYXMgZXZlbnR1YWxlcyB2aW9sYWNpb25lcyBhbCBkZXJlY2hvIGRlIHByb3BpZWRhZCBpbnRlbGVjdHVhbCBlbiBxdWUgcHVlZGEgaW5jdXJyaXIgZWwgYXV0b3IuCgpBbnRlIGN1YWxxdWllciBkZW51bmNpYSBkZSB2aW9sYWNpw7NuIGRlIGRlcmVjaG9zIGRlIHByb3BpZWRhZCBpbnRlbGVjdHVhbCwgbGEgVURFTEFSICBhZG9wdGFyw6EgdG9kYXMgbGFzIG1lZGlkYXMgbmVjZXNhcmlhcyBwYXJhIGV2aXRhciBsYSBjb250aW51YWNpw7NuIGRlIGRpY2hhIGluZnJhY2Npw7NuLCBsYXMgcXVlIHBvZHLDoW4gaW5jbHVpciBlbCByZXRpcm8gZGVsIGFjY2VzbyBhIGxvcyBjb250ZW5pZG9zIHkvbyBtZXRhZGF0b3MgZGVsIGRvY3VtZW50byByZXNwZWN0aXZvLgoKTGEgb2JyYSBzZSBwb25kcsOhIGEgZGlzcG9zaWNpw7NuIGRlbCBww7pibGljbyBhIHRyYXbDqXMgZGUgbGFzIGxpY2VuY2lhcyBDcmVhdGl2ZSBDb21tb25zLCBlbCBhdXRvciBwb2Ryw6Egc2VsZWNjaW9uYXIgdW5hIGRlIGxhcyA2IGxpY2VuY2lhcyBkaXNwb25pYmxlczoKCgpBdHJpYnVjacOzbiAoQ0MgLSBCeSk6IFBlcm1pdGUgdXNhciBsYSBvYnJhIHkgZ2VuZXJhciBvYnJhcyBkZXJpdmFkYXMsIGluY2x1c28gY29uIGZpbmVzIGNvbWVyY2lhbGVzLCBzaWVtcHJlIHF1ZSBzZSByZWNvbm96Y2EgYWwgYXV0b3IuCgpBdHJpYnVjacOzbiDigJMgQ29tcGFydGlyIElndWFsIChDQyAtIEJ5LVNBKTogUGVybWl0ZSB1c2FyIGxhIG9icmEgeSBnZW5lcmFyIG9icmFzIGRlcml2YWRhcywgaW5jbHVzbyBjb24gZmluZXMgY29tZXJjaWFsZXMsIHBlcm8gbGEgZGlzdHJpYnVjacOzbiBkZSBsYXMgb2JyYXMgZGVyaXZhZGFzIGRlYmUgaGFjZXJzZSBtZWRpYW50ZSB1bmEgbGljZW5jaWEgaWTDqW50aWNhIGEgbGEgZGUgbGEgb2JyYSBvcmlnaW5hbCwgcmVjb25vY2llbmRvIGEgbG9zIGF1dG9yZXMuCgpBdHJpYnVjacOzbiDigJMgTm8gQ29tZXJjaWFsIChDQyAtIEJ5LU5DKTogUGVybWl0ZSB1c2FyIGxhIG9icmEgeSBnZW5lcmFyIG9icmFzIGRlcml2YWRhcywgc2llbXByZSB5IGN1YW5kbyBlc29zIHVzb3Mgbm8gdGVuZ2FuIGZpbmVzIGNvbWVyY2lhbGVzLCByZWNvbm9jaWVuZG8gYWwgYXV0b3IuCgpBdHJpYnVjacOzbiDigJMgU2luIERlcml2YWRhcyAoQ0MgLSBCeS1ORCk6IFBlcm1pdGUgZWwgdXNvIGRlIGxhIG9icmEsIGluY2x1c28gY29uIGZpbmVzIGNvbWVyY2lhbGVzLCBwZXJvIG5vIHNlIHBlcm1pdGUgZ2VuZXJhciBvYnJhcyBkZXJpdmFkYXMsIGRlYmllbmRvIHJlY29ub2NlciBhbCBhdXRvci4KCkF0cmlidWNpw7NuIOKAkyBObyBDb21lcmNpYWwg4oCTIENvbXBhcnRpciBJZ3VhbCAoQ0Mg4oCTIEJ5LU5DLVNBKTogUGVybWl0ZSB1c2FyIGxhIG9icmEgeSBnZW5lcmFyIG9icmFzIGRlcml2YWRhcywgc2llbXByZSB5IGN1YW5kbyBlc29zIHVzb3Mgbm8gdGVuZ2FuIGZpbmVzIGNvbWVyY2lhbGVzIHkgbGEgZGlzdHJpYnVjacOzbiBkZSBsYXMgb2JyYXMgZGVyaXZhZGFzIHNlIGhhZ2EgbWVkaWFudGUgbGljZW5jaWEgaWTDqW50aWNhIGEgbGEgZGUgbGEgb2JyYSBvcmlnaW5hbCwgcmVjb25vY2llbmRvIGEgbG9zIGF1dG9yZXMuCgpBdHJpYnVjacOzbiDigJMgTm8gQ29tZXJjaWFsIOKAkyBTaW4gRGVyaXZhZGFzIChDQyAtIEJ5LU5DLU5EKTogUGVybWl0ZSB1c2FyIGxhIG9icmEsIHBlcm8gbm8gc2UgcGVybWl0ZSBnZW5lcmFyIG9icmFzIGRlcml2YWRhcyB5IG5vIHNlIHBlcm1pdGUgdXNvIGNvbiBmaW5lcyBjb21lcmNpYWxlcywgZGViaWVuZG8gcmVjb25vY2VyIGFsIGF1dG9yLgoKTG9zIHVzb3MgcHJldmlzdG9zIGVuIGxhcyBsaWNlbmNpYXMgaW5jbHV5ZW4gbGEgZW5hamVuYWNpw7NuLCByZXByb2R1Y2Npw7NuLCBjb211bmljYWNpw7NuLCBwdWJsaWNhY2nDs24sIGRpc3RyaWJ1Y2nDs24geSBwdWVzdGEgYSBkaXNwb3NpY2nDs24gZGVsIHDDumJsaWNvLiBMYSBjcmVhY2nDs24gZGUgb2JyYXMgZGVyaXZhZGFzIGluY2x1eWUgbGEgYWRhcHRhY2nDs24sIHRyYWR1Y2Npw7NuIHkgZWwgcmVtaXguCgpDdWFuZG8gc2Ugc2VsZWNjaW9uZSB1bmEgbGljZW5jaWEgcXVlIGhhYmlsaXRlIHVzb3MgY29tZXJjaWFsZXMsIGVsIGRlcMOzc2l0byBkZWJlcsOhIHNlciBhY29tcGHDsWFkbyBkZWwgYXZhbCBkZWwgamVyYXJjYSBtw6F4aW1vIGRlbCBTZXJ2aWNpbyBjb3JyZXNwb25kaWVudGUuCg==Institucionalhttps://www.colibri.udelar.edu.uyUniversidadhttps://udelar.edu.uy/https://www.colibri.udelar.edu.uy/oai/requestkarina.camps@seciu.edu.uyUruguayopendoar:47712025-12-09T16:57:58COLIBRI - Universidad de la Repúblicafalse
spellingShingle Unilaterally connected large digraphs and generalized cycles
Gómez, José
The (Δ,D)-problem
Unilaterally connected digraph
Moore diagraphs
status_str submittedVersion
title Unilaterally connected large digraphs and generalized cycles
title_full Unilaterally connected large digraphs and generalized cycles
title_fullStr Unilaterally connected large digraphs and generalized cycles
title_full_unstemmed Unilaterally connected large digraphs and generalized cycles
title_short Unilaterally connected large digraphs and generalized cycles
title_sort Unilaterally connected large digraphs and generalized cycles
topic The (Δ,D)-problem
Unilaterally connected digraph
Moore diagraphs
url https://hdl.handle.net/20.500.12008/51346

Resultados similares