| dc.contributor.author | Dalfó, Cristina | |
| dc.contributor.author | Fiol, Miguel Angel | |
| dc.contributor.author | López Lorenzo, Ignacio | |
| dc.date.accessioned | 2018-12-13T08:42:22Z | |
| dc.date.available | 2019-04-24T22:08:05Z | |
| dc.date.issued | 2018-04-04 | |
| dc.identifier.issn | 0364-9024 | |
| dc.identifier.uri | http://hdl.handle.net/10459.1/65307 | |
| dc.description.abstract | Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this arti- cle, we consider the case where such graphs are bipartite. As main results, we show that in this context the Moore- like bound is attained in the case of diameter k = 3, and that bipartite-mixed graphs of diameter k ≥ 4 do not exist. | |
| dc.description.sponsorship | This research have been partially supported by AGAUR under project 2017SGR1087 (C. D. and M.A. F.). The author N. L. has been supported in part by grant MTM2013-46949-P, from Ministerio de Economía y Competitividad, Spain. | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | |
| dc.publisher | Wiley | |
| dc.relation | MINECO/PN2013-2016/MTM2013-46949-P | |
| dc.relation.isformatof | Versió postprint del document publicat a https://doi.org/10.1002/jgt.22257 | |
| dc.relation.ispartof | Journal of Graph Theory, 2018, núm. 89, p. 386-394 | |
| dc.rights | (c) Wiley, 2018 | |
| dc.title | On bipartite-mixed graphs | |
| dc.type | info:eu-repo/semantics/article | |
| dc.date.updated | 2018-12-13T08:42:22Z | |
| dc.identifier.idgrec | 027831 | |
| dc.type.version | info:eu-repo/semantics/acceptedVersion | |
| dc.rights.accessRights | info:eu-repo/semantics/openAccess | |
| dc.identifier.doi | https://doi.org/10.1002/jgt.22257 | |
| dc.subject.udc | Degree/diameter problem | |
| dc.subject.udc | Diameter | |
| dc.subject.udc | Mixed graph | |
| dc.subject.udc | Moore bound | |
