The coloring of graphs.

DOI10.2307/1968214MaRDI QIDQ5893005zbMATH OpenOpenAlexWikidataFDO

Authors Hassler Whitney

Publication date 1932

Published in Annals of Mathematics. Second Series (Search for Journal in Brave)

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

Cited in

(11)

• The chromatic polynomial of grid graph P₃ P_n
• A note on graphs of k-colourings
• Dominic Welsh: his work and influence
• Incident vertex pi coloring of middle, total, line and splitting graph for star and double star graph families
• A remark on the Whitney broken circuit theorem
• Dirac traces and the Tutte polynomial
• Exact Potts/Tutte polynomials for hammock chain graphs
• An algebraic characterization of strong graphs
• The dimension of the feasible region of pattern densities
• Graph polynomials: some questions on the edge
• Polynomials counting group colorings in graphs

This page was built for publication: The coloring of graphs.

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