Um problema de coloração de arestas em grafos evitando um padrão específico em triângulos
Open Access
- 8 December 2022
- conference paper
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC) in Proceeding Series of the Brazilian Society of Computational and Applied Mathematics
- Vol. 9 (1)
Abstract
Um problema de coloração de arestas em grafos evitando um padrão específico em triângulosKeywords
This publication has 6 references indexed in Scilit:
- Remarks on an Edge-coloring ProblemElectronic Notes in Theoretical Computer Science, 2019
- The Typical Structure of Gallai Colorings and Their Extremal GraphsSIAM Journal on Discrete Mathematics, 2019
- On graphs with a large number of edge-colorings avoiding a rainbow triangleEuropean Journal of Combinatorics, 2017
- A rainbow Erdős-Rothschild problemElectronic Notes in Discrete Mathematics, 2015
- The maximum number of K 3 -free and K 4 -free edge 4-coloringsJournal of the London Mathematical Society, 2012
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUESJournal of the London Mathematical Society, 2004