Decompositions of triangle-free 5-regular graphs into paths of length five (2015)
- Authors:
- USP affiliated authors: WAKABAYASHI, YOSHIKO - IME ; BOTLER, FÁBIO HAPP - IME ; MOTA, GUILHERME OLIVEIRA - IME
- Unidade: IME
- DOI: 10.1016/j.disc.2015.04.018
- Assunto: TEORIA DOS GRAFOS
- Language: Inglês
- Imprenta:
- Source:
- Título: Discrete Mathematics
- ISSN: 1872-681X
- Volume/Número/Paginação/Ano: v. 338, n. 11, p. 1845–1855, 2015
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
BOTLER, Fábio Happ e MOTA, Guilherme Oliveira e WAKABAYASHI, Yoshiko. Decompositions of triangle-free 5-regular graphs into paths of length five. Discrete Mathematics, v. 338, n. 11, p. 1845–1855, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2015.04.018. Acesso em: 10 fev. 2026. -
APA
Botler, F. H., Mota, G. O., & Wakabayashi, Y. (2015). Decompositions of triangle-free 5-regular graphs into paths of length five. Discrete Mathematics, 338( 11), 1845–1855. doi:10.1016/j.disc.2015.04.018 -
NLM
Botler FH, Mota GO, Wakabayashi Y. Decompositions of triangle-free 5-regular graphs into paths of length five [Internet]. Discrete Mathematics. 2015 ; 338( 11): 1845–1855.[citado 2026 fev. 10 ] Available from: https://doi.org/10.1016/j.disc.2015.04.018 -
Vancouver
Botler FH, Mota GO, Wakabayashi Y. Decompositions of triangle-free 5-regular graphs into paths of length five [Internet]. Discrete Mathematics. 2015 ; 338( 11): 1845–1855.[citado 2026 fev. 10 ] Available from: https://doi.org/10.1016/j.disc.2015.04.018 - Counting graph orientations with no directed triangles
- Decompositions of highly connected graphs into paths of length five
- Decomposing highly connected graphs into paths of length five
- Decomposing regular graphs with prescribed girth into paths of given length
- Decomposing highly edge-connected graphs into paths of any given length
- On nonrepetitive colorings of paths and cycles
- Decomposição de grafos em caminhos
- Separating cycle systems
- Ramsey goodness of paths versus K3,t
- Separating the edges of a graph by cycles and by subdivisions of K4
Informações sobre o DOI: 10.1016/j.disc.2015.04.018 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
