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.Keywords: crossing-critical graphs, domination number, independence numberPublished in DiRROS: 09.04.2024; Views: 60; Downloads: 36 Full text (393,09 KB)This document has many files! More...
