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

DOI10.26493/1855-3974.2853.B51zbMath1515.05138arXiv2203.12206MaRDI QIDQ6158910

Unnamed Author, Vesna Iršič, Maruša Lekše, Unnamed Author, Unnamed Author

Publication date: 31 May 2023

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

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

zbMATH Keywords

independence numberdomination numbercrossing-critical graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large non-planar graphs and an application to crossing-critical graphs
• Infinite families of crossing-critical graphs with a given crossing number
• Construction of crossing-critical graphs
• Crossing-number critical graphs have bounded path-width
• On degree properties of crossing-critical families of graphs
• Making a graph crossing-critical by multiplying its edges
• Graphs with at most one crossing
• Characterizing 2-crossing-critical graphs
• An optimality criterion for the crossing number
• ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
• Cubic graphs with crossing number two
• Crossing numbers of sequences of graphs II: Planar tiles
• Properties of Large 2-Crossing-Critical Graphs
• A survey of graphs with known or bounded crossing numbers
• Crossing numbers of beyond-planar graphs

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