Graphs with at most one crossing

From MaRDI portal
Publication:2324508



Abstract: The crossing number of a graph G is the least number of crossings over all possible drawings of G. We present a structural characterization of graphs with crossing number one.












This page was built for publication: Graphs with at most one crossing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2324508)