Characterizing graphs with crossing number at least 2
From MaRDI portal
(Redirected from Characterizing graphs with crossing number at least 2)
Recommendations
Cites work
Cited in
(9)- Graphs with at most one crossing
- Crossing and thickness of special type of non-planar graph
- scientific article; zbMATH DE number 4055637 (Why is no real title available?)
- On 3‐regular graphs having crossing number at least 2
- Characterization of graphs with hall number 2
- Characterizing all graphs with 2-exceptional edges
- scientific article; zbMATH DE number 1842906 (Why is no real title available?)
- Characterization of Graphs of Connected Detour Number 2
- Large non-planar graphs and an application to crossing-critical graphs
This page was built for publication: Characterizing graphs with crossing number at least 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978442)