Domination and independence number of large 2-crossing-critical graphs
DOI:
https://doi.org/10.26493/1855-3974.2853.b51Keywords:
Crossing-critical graphs, domination number, independence numberAbstract
After 2-crossing-critical graphs were characterized in 2016, their most general subfamily, large 3-connected 2-crossing-critical graphs, has attracted separate attention. This paper presents sharp upper and lower bounds for their domination and independence number.
Downloads
Published
2023-03-20
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/