Domination and independence number of large 2-crossing-critical graphs
From MaRDI portal
(Redirected from Publication:6158910)
Abstract: After -crossing-critical graphs were characterized in 2016, their most general subfamily, large -connected -crossing-critical graphs, has attracted separate attention. This paper presents sharp upper and lower bounds for their domination and independence number.
Recommendations
Cites work
- A survey of graphs with known or bounded crossing numbers
- An optimality criterion for the crossing number
- Bounded degree conjecture holds precisely for c-crossing-critical graphs with c 12
- 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
- scientific article; zbMATH DE number 3829947 (Why is no real title available?)
- scientific article; zbMATH DE number 2108147 (Why is no real title available?)
- 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 degree properties of crossing-critical families of graphs
- ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
- 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)