Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/107292
Full metadata record
DC FieldValueLanguage
dc.contributor.CRUESPUNIVERSIDADE DE ESTADUAL DE CAMPINASpt
dc.identifier.isbnpt
dc.typeArtigo de periódicopt
dc.titleTutte's 3-flow Conjecture And Matchings In Bipartite Graphspt
dc.contributor.authorDa Silva C.N.pt
dc.contributor.authorDahab R.pt
unicamp.authorDa Silva, C.N., Institute of Computing, UNICAMP, Caixa Postal 6176, 13083-970, Campinas, SP, Brazilpt
unicamp.authorDahab, R., Institute of Computing, UNICAMP, Caixa Postal 6176, 13083-970, Campinas, SP, Brazilpt
dc.description.abstractTutte's 3-flow conjecture is restated as the problem of finding an orientation of the edges of a 4-edge-connected, 5-regular graph G, for which the out-flow at each vertex is +3 or -3. The induced equipartition of the vertices of G is called mod 3-orientable. We give necessary and sufficient conditions for the existence of mod 3-orientable equipartitions in general 5-regular graphs, in terms of (i) a perfect matching of a bipartite graph derived from the equipartition and (ii) the size of cuts in G.en
dc.relation.ispartofElectronic Notes in Discrete Mathematicspt_BR
dc.publisherpt
dc.date.issued2000pt
dc.identifier.citationElectronic Notes In Discrete Mathematics. , v. 7, n. , p. 114 - 117, 2000.pt
dc.language.isoenpt
dc.description.volume7pt
dc.description.issuenumberpt
dc.description.initialpage114pt
dc.description.lastpage117pt
dc.rightsfechadopt
dc.sourceScopuspt
dc.identifier.issn15710653pt
dc.identifier.doipt
dc.identifier.urlhttp://www.scopus.com/inward/record.url?eid=2-s2.0-34247222688&partnerID=40&md5=59a40e7666cd897709f1e0c4b9006854en
dc.date.available2015-06-30T19:51:12Z
dc.date.available2015-11-26T14:47:16Z-
dc.date.accessioned2015-06-30T19:51:12Z
dc.date.accessioned2015-11-26T14:47:16Z-
dc.description.provenanceMade available in DSpace on 2015-06-30T19:51:12Z (GMT). No. of bitstreams: 0 Previous issue date: 2000en
dc.description.provenanceMade available in DSpace on 2015-11-26T14:47:16Z (GMT). No. of bitstreams: 0 Previous issue date: 2000en
dc.identifier.urihttp://www.repositorio.unicamp.br/handle/REPOSIP/107292
dc.identifier.urihttp://repositorio.unicamp.br/jspui/handle/REPOSIP/107292-
dc.identifier.idScopus2-s2.0-34247222688pt
dc.description.referenceBondy, J.A., Murty, U.S.R., (1976) Graph Theory with Applications, , Elsevier North Hollandpt
dc.description.referenceDe Almeida E Silva, L.M., (1991) Fluxos Inteiros Em Grafos, , Master's thesis, UNICAMPpt
dc.description.referenceYounger, D.H., Integer Flows (1983) J. Graph Theory, 7, pp. 349-357pt
dc.description.referenceZhang, C.-Q., (1997) Integer Flows and Cycle Covers of Graphs, , Marcel Dekkerpt
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
There are no files associated with this item.


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