A state calculus for graph coloring

From MaRDI portal

Revision as of 17:11, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2359551

Jump to:navigation, search

zbMath1365.05090arXiv1511.06844MaRDI QIDQ2359551

Louis H. Kauffman

Publication date: 22 June 2017

Published in: Illinois Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.06844

zbMATH Keywords

cubic graphs Penrose Bracket

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On ribbon graphs and virtual links ⋮ The 2-factor polynomial detects even perfect matchings ⋮ Edge colourings and topological graph polynomials

This page was built for publication: A state calculus for graph coloring

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2359551&oldid=14968981"