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

From MaRDI portal
Publication:6158910

DOI10.26493/1855-3974.2853.B51zbMATH Open1515.05138arXiv2203.12206MaRDI QIDQ6158910FDOQ6158910


Authors: Vesna Iršič, Maruša Lekše Edit this on Wikidata


Publication date: 31 May 2023

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2203.12206




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Domination and independence number of large 2-crossing-critical graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6158910)