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

preprint2022arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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