pesquisa
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| pesquisa [2025/05/20 14:33] – external edit 127.0.0.1 | pesquisa [2025/08/08 15:23] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 3: | Line 3: | ||
| ==== Trabalhos aceitos/ | ==== Trabalhos aceitos/ | ||
| - | * Aurichi, L. F., Magalhães Júnior, P., Zdomskyy, L., On cycle covers of infinite bipartite graphs [[https:// | + | * Aurichi, L. F., Magalhães Júnior, P., Zdomskyy, L., On cycle covers of infinite bipartite graphs [[https:// |
| - | * Aurichi, L. F., Magalhães Júnior, P., Seixas, L. G., Limits of cycles and cover conjectures | + | |
| * Aurichi, L. F., Real, L., Remarks on the countable case of the Unfriendly Partition Problem [[https:// | * Aurichi, L. F., Real, L., Remarks on the countable case of the Unfriendly Partition Problem [[https:// | ||
| * Aurichi, L., Fernandes, G., Magalhães Júnior, P., On ends of degree $\omega_1$ [[https:// | * Aurichi, L., Fernandes, G., Magalhães Júnior, P., On ends of degree $\omega_1$ [[https:// | ||
| Line 11: | Line 10: | ||
| ==== Trabalhos publicados ===== | ==== Trabalhos publicados ===== | ||
| + | * Aurichi, L. F., Magalhães Júnior, P., Seixas, L. G., Limits of cycles and cover conjectures, | ||
| * Aurichi, L. F., Real, L., Edge-connectivity between edge-ends of infinite graphs, Journal of Graph Theory - 2025 [[https:// | * Aurichi, L. F., Real, L., Edge-connectivity between edge-ends of infinite graphs, Journal of Graph Theory - 2025 [[https:// | ||
| * Aurichi, L. F., Bonanzinga, M., Giacopello, D., On some topological games involving networks Top. Appl. v. 351 - 2024 | * Aurichi, L. F., Bonanzinga, M., Giacopello, D., On some topological games involving networks Top. Appl. v. 351 - 2024 | ||
pesquisa.1747762424.txt.gz · Last modified: 2025/05/20 14:33 by 127.0.0.1