On a problem of P. Erdös

DOI10.1016/S0021-9800(68)80013-4zbMATH Open0182.57901MaRDI QIDQ5572942FDOQ5572942

Paul C. Kainen

Publication date: 1968

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

complete graphcrossing number

Mathematics Subject Classification ID

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

Cited In (16)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Über die Kreuzungszahl vollständiger, n‐geteilter Graphen
• An upper bound for the rectilinear crossing number of the complete graph
• A distance problem of P. Erdős with some further restrictions
• Graph theory
• Geometria combinatoria e geometrie finite
• A note on fundamental, non-fundamental, and robust cycle bases
• Title not available (Why is that?)
• Title not available (Why is that?)
• Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill
• Coloring drawings of bipartite graphs: A problem in automated assembly
• Title not available (Why is that?)
• On polynomials and crossing numbers of complete graphs
• On a problem of P. Erdős

This page was built for publication: On a problem of P. Erdös

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