Crossing-critical edges and Kuratowski subgraphs of a graph

  title={Crossing-critical edges and Kuratowski subgraphs of a graph},
  author={Jozef Sir{\'a}n},
  journal={J. Comb. Theory, Ser. B},
An edge e of a graph G is said to be crossing-critical if cr(G e) < cr(G), where cr(G) denotes the crossing number of G on the plane. It is proved that any crossingcritical edge e of a graph G for which cr(G e) ( 1 belongs to a subdivision of K, or K,,,, the Kuratowski subgraphs of G. Further, as regards crossing-critical edges e of G for which cr(G e) > 5, it is shown that the properties of “being a crossingcritical edge of G” and “being contained in a Kuratowski subgraph of G” are independent… CONTINUE READING
3 Citations
7 References
Similar Papers


Publications referenced by this paper.
Showing 1-7 of 7 references

A set of topological invariants for graphs

  • Il. P. TOMASTA
  • J . Combin . Theory Ser . B
  • 1980

BEINEKE, The crossing number of C, x C

  • J. Combin. Theory Ser.B
  • 1978
1 Excerpt

Parity of numbers of crossings for complete n-partite graphs, Much

  • Sfovnca
  • 1976

DIRAC AND S. SCHUSTER, A theorem of Kuratowski

  • G A.
  • Indug. Math
  • 1954

A note on primative skew curves

  • D. W. HALL
  • Bull. Amer. Muth. Sot
  • 1943
1 Excerpt

Sur le probleme des courbes gauches en topologie

  • Fund. Muth
  • 1930
2 Excerpts

Similar Papers

Loading similar papers…