Emparelhamento em grafos bipartidos

• Ano de defesa: 2017
• Autor(a) principal: Gizelle Cristina Guisso de Lima
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Brasil; Departamento de Matemática; Programa de Pós-Graduação em Matemática em Rede Nacional (PROFMAT); UEM; Maringá, PR; Centro de Ciências Exatas
• Palavras-chave em Português: Grafos; Problemas combinatórios; Grafos bipartidos; Coberturas de arestas; Emparelhamento; Graphs; Combinatorial problems; Bipartite grafs, Matching; Coverage; Ciências Exatas e da Terra; Matemática
• Link de acesso: http://repositorio.uem.br:8080/jspui/handle/1/5545

A crucial step in solving a real problem is its representation by a diagram. The graph can be such a tool, ideal for the schematization of situations in several areas, for example, physical networks, road networks, electrical circuits, as well as the interactions that occur between individuals in an ecosystem or in a web of social relations. The introductory concepts of Graph Theory are easy to understand, even by students at an early stage of their formation, both in elementary and middle school. Thus, such theory is a motivating topic and an aid in the understanding, modeling and resolution of problems in which there is a set of objects in some way related. In this sense, our work is about an introduction to the problems of pairing in bipartite graphs and covers