Sepehr Hajebi, Holes, hubs and bounded treewidth
Zoom ID: 869 4632 6610 (ibsdimag)A hole in a graph $G$ is an induced cycle of length at least four, and for every hole $H$ in $G$, a vertex $h\in G\setminus H$ is called a …
기초과학연구원 이산수학그룹
기초과학연구원 이산수학그룹
A hole in a graph $G$ is an induced cycle of length at least four, and for every hole $H$ in $G$, a vertex $h\in G\setminus H$ is called a …