Decomposing highly edge-connected graphs into paths of any given length (2017)
- Authors:
- USP affiliated authors: WAKABAYASHI, YOSHIKO - IME ; MOTA, GUILHERME OLIVEIRA - IME
- Unidade: IME
- DOI: 10.1016/j.jctb.2016.07.010
- Subjects: COMBINATÓRIA; TEORIA DOS GRAFOS
- Keywords: Path; Decomposition; Connectivity
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Journal of Combinatorial Theory, Series B
- ISSN: 0095-8956
- Volume/Número/Paginação/Ano: v. 122, p. 508-542, 2017
- 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 highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B, v. 122, p. 508-542, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.jctb.2016.07.010. Acesso em: 23 abr. 2024. -
APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2017). Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B, 122, 508-542. doi:10.1016/j.jctb.2016.07.010 -
NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122 508-542.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.jctb.2016.07.010 -
Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122 508-542.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.jctb.2016.07.010 - Decomposing highly connected graphs into paths of length five
- Decomposing regular graphs with prescribed girth into paths of given length
- Decompositions of triangle-free 5-regular graphs into paths of length five
- Combinatória
- Counting orientations of graphs with no strongly connected tournaments
- Counting orientations of random graphs with no directed k‐cycles
- 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.jctb.2016.07.010 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2840621.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
