Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Marcio Antônio Duarte"'
Publikováno v:
Revista Extensão & Cidadania, Vol 6, Iss 11 (2019)
Neste artigo são apresentados resultados e experiências da execução do evento de extensão denominado: Encontro Anual de Computação (EnAComp. Esse evento ocorreu na Regional Catalão (RC) da Universidade Federal de Goiás (UFG), reunindo profes
Externí odkaz:
https://doaj.org/article/e715529852a34a259673b745caa9e451
Publikováno v:
Brazilian Journal of Development. 7:54581-54589
Publikováno v:
Revista Extensão & Cidadania; v. 6 n. 11 (2019): v.6, n.11 jan./jun. 2019; 15
Neste artigo são apresentados resultados e experiências da execução do evento de extensão denominado: Encontro Anual de Computação (EnAComp. Esse evento ocorreu na Regional Catalão (RC) da Universidade Federal de Goiás (UFG), reunindo profes
Publikováno v:
Electronic Notes in Discrete Mathematics. 50:9-14
Kobler and Rotics in 2003, and Cameron and Walker in 2005, gave a complete structural description of the graphs G where the matching number ν ( G ) equals the induced matching number ν 2 ( G ) . We study their result and use it to analyse graphs G
Publikováno v:
Journal of Combinatorial Optimization. 33:365-372
The complementary prism $$G\bar{G}$$GG? of a graph G arises from the disjoint union of the graph G and its complement $$\bar{G}$$G? by adding the edges of a perfect matching joining pairs of corresponding vertices of G and $$\bar{G}$$G?. Haynes, Henn
Publikováno v:
Theoretical Computer Science. 588:131-137
Extending results of Kobler and Rotics (2003), Cameron and Walker (2005) gave a complete structural description of the graphs G where the matching number ? ( G ) equals the induced matching number ? 2 ( G ) . We present a short proof of their result
Publikováno v:
Journal of Combinatorial Optimization; Feb2017, Vol. 33 Issue 2, p365-372, 8p