DC Field | Value | Language |
dc.contributor.author | GOMORA FIGUEROA, ANA PAULINA | - |
dc.contributor.author | LLANO PEREZ, BERNANRDO | - |
dc.contributor.author | OLSEN, MIKA | - |
dc.contributor.author | RIVERA 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.accessioned | 2020-07-02T17:48:16Z | - |
dc.date.available | 2020-07-02T17:48:16Z | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | Discrete Appliet Mathematics, vol. 160, Issues 10–11, July 2012 | en_US |
dc.identifier.uri | http://ilitia.cua.uam.mx:8080/jspui/handle/123456789/562 | - |
dc.description.abstract | The 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.sponsorship | Discrete Appliet Mathematics | en_US |
dc.language.iso | Inglés | en_US |
dc.publisher | Ámsterdam : Elsevier | en_US |
dc.relation.haspart | 0166-218X | - |
dc.rights | https://doi.org/10.1016/j.dam.2012.03.008 | - |
dc.rights | https://www.sciencedirect.com/science/article/pii/S0166218X12001126 | - |
dc.subject | Modelos acíclicos | en_US |
dc.subject | Matemáticas | en_US |
dc.title | On the acyclic disconnection of multipartite tournaments | en_US |
dc.type | Artículo | en_US |
Aparece en las colecciones: | Artículos
|