Iskanje po repozitoriju

A+ | A- | | SLO | ENG

Povzetek: 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.
Ključne besede: crossing-critical graphs, domination number, independence number
Objavljeno v DiRROS: 09.04.2024; Ogledov: 57; Prenosov: 33
Celotno besedilo (393,09 KB)
Gradivo ima več datotek! Več...