Non-separable and planar graphs.

DOI10.2307/1989545MaRDI QIDQ5893006zbMATH OpenOpenAlexWikidataFDO

Authors Hassler Whitney

Publication date 1932

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1989545

Cited in

(9)

• On planarity of graphs in homotopy type theory
• Strongly proper connected coloring of graphs
• Recovering a magnitude-symmetric matrix from its principal minors
• Cyclic base ordering of certain degenerate graphs
• Changing and unchanging of the connected domination number of a graph
• Geometric thickness of multigraphs is \(\exists \mathbb{R}\)-complete
• Computing the forcing spectrum of outerplanar graphs in polynomial time
• Dual matroids of 2-complexes -- revisited
• On one approach to enumeration of labeled connected graphs: a review

This page was built for publication: Non-separable and planar graphs.

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