The crossing number V(G) of a graph G is the minimum number of crossings in any good drawing of G in the plane. For a rigorous development of the concept of crossing number and for a survey ofâ€¦ (More)

In this paper w e give a construction that produces exactly those graphs having maximum rectilinear crossing number equal to the subthrackle bound. We then prove a theorem characterizing these graphsâ€¦ (More)

The inclusive edge (vertex, mixed) connectivity of a vertex v is the minimum number of edges (vertices, graph elements) whose removal yields a subgraph in which v is a cutvertex. Stability under edgeâ€¦ (More)

The graphs dealt with in this paper are finite, connected, and lack loops and multiple edges. If G is such a graph, we denote its vertex and edge sets by VG and EG respectively. Its maximum genus,â€¦ (More)