Domination and independence number of large 2-crossing-critical graphs
DOI10.26493/1855-3974.2853.B51zbMATH Open1515.05138arXiv2203.12206MaRDI QIDQ6158910FDOQ6158910
Authors: Vesna Iršič, Maruša Lekše
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
Recommendations
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)
Cites Work
- Characterizing 2-crossing-critical graphs
- Large non-planar graphs and an application to crossing-critical graphs
- An optimality criterion for the crossing number
- Cubic graphs with crossing number two
- Construction of crossing-critical graphs
- Crossing-number critical graphs have bounded path-width
- Crossing numbers of sequences of graphs II: Planar tiles
- Infinite families of crossing-critical graphs with a given crossing number
- Title not available (Why is that?)
- ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
- Crossing numbers of beyond-planar graphs
- On degree properties of crossing-critical families of graphs
- Making a graph crossing-critical by multiplying its edges
- Title not available (Why is that?)
- Graphs with at most one crossing
- Title not available (Why is that?)
- A survey of graphs with known or bounded crossing numbers
- Properties of large 2-crossing-critical graphs
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)