scientific article; zbMATH DE number 3503275

MaRDI QIDQ4083453zbMATH OpenFDO

Authors Heiko Harborth

Publication date 1976

Full work available at URL https://eudml.org/doc/33976

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites work

• scientific article; zbMATH DE number 3394160 (Why is no real title available?)
• scientific article; zbMATH DE number 3404259 (Why is no real title available?)
• The crossing number of K5,n
• Über die Kreuzungszahl vollständiger, n‐geteilter Graphen

Cited in

(13)

• Removing even crossings on surfaces
• Coloring drawings of bipartite graphs: A problem in automated assembly
• Edges without crossings in drawings of complete graphs
• A note on the parity of the number of crossings of a graph
• Subthrackleable graphs and four-cycles
• Homomorphic preimages of geometric paths
• Weighted Turán problems with applications
• Removing Even Crossings on Surfaces
• Bad drawings of small complete graphs
• Different types of isomorphisms of drawings of complete multipartite graphs
• The crossing numbers of \(K_{3,3,n}\) and \(K_{3,3}\Box T\)
• Crossing-critical edges and Kuratowski subgraphs of a graph
• Removing even crossings

This page was built for publication:

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