Domination and independence number of large 2-crossing-critical graphs

Authors

  • Vesna Iršič University of Ljubljana, Slovenia and Institute of Mathematics, Physics, and Mechanics, Slovenia
  • Maruša Lekše University of Ljubljana, Slovenia and Institute of Mathematics, Physics, and Mechanics, Slovenia
  • Mihael Pačnik University of Ljubljana, Slovenia
  • Petra Podlogar University of Ljubljana, Slovenia
  • Martin Praček University of Ljubljana, Slovenia

DOI:

https://doi.org/10.26493/1855-3974.2853.b51

Keywords:

Crossing-critical graphs, domination number, independence number

Abstract

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

Vol. 23 No. 4 (2023)

Section

Articles

License

Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/