Domination and independence number of large $2$-crossing-critical graphs
Combinatorics
2022-03-24 v1
Abstract
After -crossing-critical graphs were characterized in 2016, their most general subfamily, large -connected -crossing-critical graphs, has attracted separate attention. This paper presents sharp upper and lower bounds for their domination and independence number.
Cite
@article{arxiv.2203.12206,
title = {Domination and independence number of large $2$-crossing-critical graphs},
author = {Vesna Iršič and Maruša Lekše and Mihael Pačnik and Petra Podlogar and Martin Praček},
journal= {arXiv preprint arXiv:2203.12206},
year = {2022}
}
Comments
18 pages, 15 figures