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

DOI10.26493/1855-3974.2853.B51MaRDI QIDQ6158910zbMATH OpenFDO

Authors Vesna Iršič, Maruša Lekše

Publication date 31 May 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

domination numberindependence numbercrossing-critical graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

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.

Recommendations

• Properties of large 2-crossing-critical graphs
• Stars and Bonds in Crossing-Critical Graphs
• scientific article; zbMATH DE number 881277
• scientific article; zbMATH DE number 147653
• Some results on 3-domination critical graphs

Cites work

• scientific article; zbMATH DE number 3829947 (Why is no real title available?)
• scientific article; zbMATH DE number 2108147 (Why is no real title available?)
• scientific article; zbMATH DE number 7559214 (Why is no real title available?)
• A survey of graphs with known or bounded crossing numbers
• An optimality criterion for the crossing number
• Characterizing 2-crossing-critical graphs
• Construction of crossing-critical graphs
• Crossing numbers of beyond-planar graphs
• Crossing numbers of sequences of graphs II: Planar tiles
• Crossing-number critical graphs have bounded path-width
• Cubic graphs with crossing number two
• Graphs with at most one crossing
• Infinite families of crossing-critical graphs with a given crossing number
• Large non-planar graphs and an application to crossing-critical graphs
• Making a graph crossing-critical by multiplying its edges
• ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
• On degree properties of crossing-critical families of graphs
• Properties of large 2-crossing-critical graphs

Cited in

(3)

• On the \((Q\)-)index of 2-domination critical graphs
• scientific article; zbMATH DE number 881277 (Why is no real title available?)
• Properties of large 2-crossing-critical graphs

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)