On the decomposition of a complete graph into planar subgraphs

DOI10.1016/0016-0032(67)90090-7zbMath0202.55604OpenAlexW2005649357MaRDI QIDQ2541350

Hiroshi Ozaki, Hiromitsu Takahashi, I. Shirkawa

Publication date: 1967

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(67)90090-7

Related Items (1)

Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings

Cites Work

• Convex Representations of Graphs
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• How to Draw a Graph
• Unnamed Item

This page was built for publication: On the decomposition of a complete graph into planar subgraphs