Decomposing regular graphs with prescribed girth into paths of given length (2017)
- Authors:
- USP affiliated authors: WAKABAYASHI, YOSHIKO - IME ; MOTA, GUILHERME OLIVEIRA - IME
- Unidade: IME
- DOI: 10.1016/j.ejc.2017.06.011
- Assunto: COMBINATÓRIA
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: European Journal of Combinatorics
- ISSN: 0195-6698
- Volume/Número/Paginação/Ano: v.66, p.28-36, 2017
- Conference titles: Conference on Combinatorics, Graph Theory and Applications - EUROCOMB
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: hybrid
- Licença: publisher-specific-oa
-
ABNT
BOTLER, Fábio Happ et al. Decomposing regular graphs with prescribed girth into paths of given length. European Journal of Combinatorics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.ejc.2017.06.011. Acesso em: 26 abr. 2024. , 2017 -
APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2017). Decomposing regular graphs with prescribed girth into paths of given length. European Journal of Combinatorics. Amsterdam: Elsevier. doi:10.1016/j.ejc.2017.06.011 -
NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing regular graphs with prescribed girth into paths of given length [Internet]. European Journal of Combinatorics. 2017 ;66 28-36.[citado 2024 abr. 26 ] Available from: https://doi.org/10.1016/j.ejc.2017.06.011 -
Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing regular graphs with prescribed girth into paths of given length [Internet]. European Journal of Combinatorics. 2017 ;66 28-36.[citado 2024 abr. 26 ] Available from: https://doi.org/10.1016/j.ejc.2017.06.011 - Decomposing highly connected graphs into paths of length five
- Decomposing highly edge-connected graphs into paths of any given length
- Decompositions of triangle-free 5-regular graphs into paths of length five
- Combinatória
- Counting orientations of random graphs with no directed k‐cycles
- Counting orientations of graphs with no strongly connected tournaments
- Decompositions of highly connected graphs into paths of length five
- Counting Ck -free orientations of G(n, p)
- Counting orientations of graphs with no strongly connected tournaments
- Some results on irregular decomposition of graphs
Informações sobre o DOI: 10.1016/j.ejc.2017.06.011 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2861619.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
