On path-cycle decompositions of triangle-free graphs (2017)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- Assunto: TEORIA DOS GRAFOS
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Discrete Mathematics and Theoretical Computer Science
- ISSN: 1365-8050
- Volume/Número/Paginação/Ano: v. 19, n. 3, [21 p.], 2017
-
ABNT
JIMÉNEZ, Andrea e WAKABAYASHI, Yoshiko. On path-cycle decompositions of triangle-free graphs. Discrete Mathematics and Theoretical Computer Science, v. 19, n. 3, p. [21 ], 2017Tradução . . Disponível em: https://dmtcs.episciences.org/4010. Acesso em: 18 abr. 2024. -
APA
Jiménez, A., & Wakabayashi, Y. (2017). On path-cycle decompositions of triangle-free graphs. Discrete Mathematics and Theoretical Computer Science, 19( 3), [21 ]. Recuperado de https://dmtcs.episciences.org/4010 -
NLM
Jiménez A, Wakabayashi Y. On path-cycle decompositions of triangle-free graphs [Internet]. Discrete Mathematics and Theoretical Computer Science. 2017 ; 19( 3): [21 ].[citado 2024 abr. 18 ] Available from: https://dmtcs.episciences.org/4010 -
Vancouver
Jiménez A, Wakabayashi Y. On path-cycle decompositions of triangle-free graphs [Internet]. Discrete Mathematics and Theoretical Computer Science. 2017 ; 19( 3): [21 ].[citado 2024 abr. 18 ] Available from: https://dmtcs.episciences.org/4010 - Um algoritmo híbrido para o problema de corte unidimensional
- Contribuições a teoria dos grafos e otimização combinatória
- Two-and three-dimensional parametric packing
- Composition of facets of the clique partitioning polytope
- On the circuit cover problem for mixed graphs
- Near-optimum universal graphs for graphs with bounded degrees
- The maximum agreement forest problem: approximation algorithms and computational experiments
- Tree 3-spanners on generalized prisms of graphs
- Covering a graph with nontrivial vertex-disjoint paths: existence and optimization
- Sobre grafos hamiltonianos
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2863205.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
