Conditions that a graph have a dual

DOI10.1090/S0002-9904-1932-05460-XzbMATH Open58.0647.18MaRDI QIDQ567166FDOQ567166

Authors: Hassler Whitney 

Publication date: 1932

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

Cited In (1)

• Independence number and maximal chromatic polynomials of connected graphs

This page was built for publication: Conditions that a graph have a dual

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