Logo
Logo
Campo de búsqueda / búsqueda general

 
Autor
Título
Tema

Full metadata record
DC FieldValueLanguage
dc.contributor.authorGOMORA FIGUEROA, ANA PAULINA-
dc.contributor.authorLLANO PEREZ, BERNANRDO-
dc.contributor.authorOLSEN, MIKA-
dc.contributor.authorRIVERA OCAMPO, EDUARDO-
dc.coverage.spatial<dc:creator id="info:eu-repo/dai/mx/cvu/173872">ANA PAULINA GOMORA FIGUEROA</dc:creator>-
dc.coverage.spatial<dc:creator id="info:eu-repo/dai/mx/cvu/111952">BERNARDO LLANO PEREZ</dc:creator>-
dc.coverage.spatial<dc:creator id="info:eu-repo/dai/mx/cvu/201785">MIKA OLSEN</dc:creator>-
dc.coverage.spatial<dc:creator id="info:eu-repo/dai/mx/cvu/5343">EDUARDO RIVERA OCAMPO</dc:creator>-
dc.coverage.temporal<dc:subject>info:eu-repo/classification/cti/7</dc:subject>-
dc.date.accessioned2020-07-02T17:48:16Z-
dc.date.available2020-07-02T17:48:16Z-
dc.date.issued2012-
dc.identifier.citationDiscrete Appliet Mathematics, vol. 160, Issues 10–11, July 2012en_US
dc.identifier.urihttp://ilitia.cua.uam.mx:8080/jspui/handle/123456789/562-
dc.description.abstractThe acyclic disconnection of a digraph D is the maximum number of components that can be obtained by deleting from D the set of arcs of an acyclic subdigraph. We give bounds for the acyclic disconnection of strongly connected bipartite tournaments and of regular bipartite tournaments. For the latter case, we exhibit an infinite family of tournaments with acyclic disconnection equal to 4.en_US
dc.description.sponsorshipDiscrete Appliet Mathematicsen_US
dc.language.isoInglésen_US
dc.publisherÁmsterdam : Elsevieren_US
dc.relation.haspart0166-218X-
dc.rightshttps://doi.org/10.1016/j.dam.2012.03.008-
dc.rightshttps://www.sciencedirect.com/science/article/pii/S0166218X12001126-
dc.subjectModelos acíclicosen_US
dc.subjectMatemáticasen_US
dc.titleOn the acyclic disconnection of multipartite tournamentsen_US
dc.typeArtículoen_US
Aparece en las colecciones:Artículos

Ficheros en este ítem:
Fichero Descripción TamañoFormato 
On the acyclic disconnection of multipartie.pdf233.51 kBAdobe PDFVisualizar/Abrir


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.