20.500.12556/DiRROS-18635 Domination and independence numbers of large 2-crossing-critical graphs 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. crossing-critical graphs domination number independence number prekrižno-kritični grafi dominantno število neodvisnostno število true false true Angleški jezik Slovenski jezik Neznano 2024-04-09 08:30:02 2024-04-09 08:30:02 2024-04-10 03:38:21 0000-00-00 00:00:00 2023 0 0 art. P4.05 (14 str.) no. 4 Vol. 23 2023 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2023-01-01 519.172 1855-3966 10.26493/1855-3974.2853.b51 146196483 amc_2853-3.pdf amc_2853-3.pdf 1 7D34E7C2903A8129D50429F5B2E9A526 b63e596e5013d826f8e9b6d97cab13ad2710c21ba5ae260fe14a1c208a050114 49b040ec-f62a-11ee-ae20-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=25441 https://amc-journal.eu/index.php/amc/article/view/2853 0 5ae9c867-f62a-11ee-ae20-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=25442 Inštitut za matematiko, fiziko in mehaniko 0 0 0