Clique immersions in graphs of independence number two with certain forbidden subgraphs

dc.contributor.author	Quiroz, Daniel A.
dc.date.accessioned	2022-11-30T02:46:50Z
dc.date.available	2022-11-30T02:46:50Z
dc.date.issued	2021
dc.description.abstract	The Lescure–Meyniel conjecture is the analogue of Hadwiger’s conjecture for the immersion order. It states that every graph contains the complete graph as an immersion, and like its minor-order counterpart it is open even for graphs with independence number 2. We show that every graph with independence number and no hole of length between 4 and satisfies this conjecture. In particular, every -free graph with satisfies the Lescure–Meyniel conjecture. We give another generalisation of this corollary, as follows. Let and be graphs with independence number at most 2, such that . If is -free, then satisfies the Lescure–Meyniel conjecture.	en_ES
dc.facultad	Facultad de Ingeniería	en_ES
dc.file.name	Quiroz_Cli2021.pdf
dc.identifier.doi	https://doi.org/10.1016/j.disc.2021.112365
dc.identifier.uri	http://repositoriobibliotecas.uv.cl/handle/uvscl/7506
dc.language	en
dc.publisher	Elsevier
dc.source	Discrete Mathematics
dc.subject	GRAPH IMMERSION	en_ES
dc.subject	INDEPENDENCE NUMBER	en_ES
dc.subject	FORBIDDEN SUBGRAPHS	en_ES
dc.subject	CHROMATIC NUMBER	en_ES
dc.subject	HADWIGER’S CONJECTURE	en_ES
dc.subject	CLIQUE	en_ES
dc.title	Clique immersions in graphs of independence number two with certain forbidden subgraphs
dc.type	Articulo
uv.departamento	Instituto de Ingenieria Matematica
uv.notageneral	No disponible para descarga

Archivos

Mostrando 1 - 1 de 1