Über die Kreuzungszahl vollständiger, n‐geteilter Graphen

DOI10.1002/MANA.19710480113MaRDI QIDQ5623701zbMATH OpenOpenAlexFDO

Authors Heiko Harborth

Publication date 1971

Published in Mathematische Nachrichten (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/mana.19710480113

zbMATH Keywords

complete multipartite graphscrossing number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cites work

• On a problem of P. Erdös

Cited in

(13)

• The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds
• Die Anzahl nicht-isomorpher \(m\)-Graphen
• scientific article; zbMATH DE number 3891400 (Why is no real title available?)
• scientific article; zbMATH DE number 3918410 (Why is no real title available?)
• scientific article; zbMATH DE number 3972879 (Why is no real title available?)
• scientific article; zbMATH DE number 4097407 (Why is no real title available?)
• scientific article; zbMATH DE number 3503275 (Why is no real title available?)
• A survey of graphs with known or bounded crossing numbers
• scientific article; zbMATH DE number 3212732 (Why is no real title available?)
• Different types of isomorphisms of drawings of complete multipartite graphs
• On the rectilinear crossing number of complete balanced multipartite graphs and balanced layered graphs
• Conjectures about wheels without one edge
• The crossing number of \(K_{1,m,n}\)

This page was built for publication: Über die Kreuzungszahl vollständiger, n‐geteilter Graphen

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