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

DOI10.1002/MANA.19710480113zbMATH Open0219.05053OpenAlexW2019461903MaRDI QIDQ5623701FDOQ5623701

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 (11)

• The crossing number of \(K_{1,m,n}\)
• Title not available (Why is that?)
• Die Anzahl nicht-isomorpher \(m\)-Graphen
• Different types of isomorphisms of drawings of complete multipartite graphs
• The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey of graphs with known or bounded crossing numbers

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)