共 50 条
Complete immersions in graphs with independence number two and small forbidden subgraphs
被引:0
|作者:
Quiroz, Daniel A.
[1
]
机构:
[1] Univ Valparaiso, Inst Ingn Matemat CIMFAV, Valparaiso, Chile
来源:
基金:
巴西圣保罗研究基金会;
关键词:
Graph immersion;
independence number;
chromatic number;
induced subgraph;
Hadwiger's conjecture;
D O I:
10.1016/j.procs.2021.11.042
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
The analogue of Hadwiger's conjecture for the immersion order states that every graph G contains the complete graph K-chi(G) as an immersion. Like its minor-order counterpart it is open even for graphs with independence number 2. Let G and H be graphs with independence number at most 2, such that vertical bar V(H)vertical bar <= 4. We show that if G is H-free, then G satisfies the conjecture. (C) 2021 The Authors. Published by Elsevier B.V.
引用
收藏
页码:343 / 349
页数:7
相关论文