Unfriendly partitions when avoiding vertices of finite degree (2023)
- Authors:
- USP affiliated authors: AURICHI, LEANDRO FIORINI - ICMC ; REAL, LUCAS SILVA SINZATO - ICMC
- Unidade: ICMC
- Subjects: TEORIA DOS GRAFOS; TEORIA DOS CONJUNTOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Journal of Logic and Computation
- ISSN: 0955-792X
- Volume/Número/Paginação/Ano: In press
-
ABNT
AURICHI, Leandro Fiorini e REAL, Lucas Silva Sinzato. Unfriendly partitions when avoiding vertices of finite degree. Journal of Logic and Computation, 2023Tradução . . Disponível em: https://doi.org/10.1093/logcom/exad070. Acesso em: 05 jun. 2024. -
APA
Aurichi, L. F., & Real, L. S. S. (2023). Unfriendly partitions when avoiding vertices of finite degree. Journal of Logic and Computation. Recuperado de https://doi.org/10.1093/logcom/exad070 -
NLM
Aurichi LF, Real LSS. Unfriendly partitions when avoiding vertices of finite degree [Internet]. Journal of Logic and Computation. 2023 ;[citado 2024 jun. 05 ] Available from: https://doi.org/10.1093/logcom/exad070 -
Vancouver
Aurichi LF, Real LSS. Unfriendly partitions when avoiding vertices of finite degree [Internet]. Journal of Logic and Computation. 2023 ;[citado 2024 jun. 05 ] Available from: https://doi.org/10.1093/logcom/exad070 - Problem-solving techniques in infinite graphs
- Selective versions of chain condition-type properties
- Relations between a topological game and the 'G IND. 'delta''-diagonal property
- Maximal topologies with respect to a family of discrete subsets
- Productively countably tight spaces of the form 'C IND. K'(X)
- D-spaces, separation axioms and covering properties
- Topological games and Alster spaces
- Tightness games with bounded finite selections
- A game for 'G IND. 'delta''-diagonal spaces
- Selectively c.c.c. spaces
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas