On a problem of P. Erdös

DOI10.1016/S0021-9800(68)80013-4zbMath0182.57901MaRDI QIDQ5572942

Paul C. Kainen

Publication date: 1968

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

zbMATH Keywords

crossing numbercomplete graph

Mathematics Subject Classification ID

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

Related Items (8)

Über die Kreuzungszahl vollständiger, n‐geteilter Graphen ⋮ Geometria combinatoria e geometrie finite ⋮ Coloring drawings of bipartite graphs: A problem in automated assembly ⋮ Graph theory ⋮ A note on fundamental, non-fundamental, and robust cycle bases ⋮ On polynomials and crossing numbers of complete graphs ⋮ An upper bound for the rectilinear crossing number of the complete graph ⋮ Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill

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