Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract) (2025)
- Authors:
- USP affiliated authors: BOTLER, FÁBIO HAPP - IME ; FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- Subjects: TEORIA DOS GRAFOS; COMBINATÓRIA
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: HUN-REN Alfréd Rényi Institute of Mathematics
- Publisher place: Budapeste
- Date published: 2025
- Source:
- Título: Proceedings - Booklet of extended abstracts
- Volume/Número/Paginação/Ano: p. 156-162, 2025
- Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB
-
ABNT
BOTLER, Fábio Happ e FERNANDES, Cristina Gomes. Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract). 2025, Anais.. Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics, 2025. p. 156-162. Disponível em: https://repositorio.usp.br/directbitstream/c8cf92ab-2c7f-415a-8d02-2b4040ca395e/3271547.pdf. Acesso em: 27 dez. 2025. -
APA
Botler, F. H., & Fernandes, C. G. (2025). Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract). In Proceedings - Booklet of extended abstracts (p. 156-162). Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics. Recuperado de https://repositorio.usp.br/directbitstream/c8cf92ab-2c7f-415a-8d02-2b4040ca395e/3271547.pdf -
NLM
Botler FH, Fernandes CG. Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 156-162.[citado 2025 dez. 27 ] Available from: https://repositorio.usp.br/directbitstream/c8cf92ab-2c7f-415a-8d02-2b4040ca395e/3271547.pdf -
Vancouver
Botler FH, Fernandes CG. Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 156-162.[citado 2025 dez. 27 ] Available from: https://repositorio.usp.br/directbitstream/c8cf92ab-2c7f-415a-8d02-2b4040ca395e/3271547.pdf - Independent dominating sets in planar triangulations
- Extremal problems on forest cuts and acyclic neighborhoods in sparse graphs (extended abstract)
- On nonrepetitive colorings of paths and cycles
- Decomposição de grafos em caminhos
- Ramsey goodness of paths versus unbalanced graphs
- Rainbow path covers of sparse random graphs (extended abstract)
- Separating cycle systems
- Biclique immersions in graphs with independence number 2
- Separating the edges of a graph by cycles and by subdivisions of K4
- Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3271547.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
