Enumerating the total colorings of a polyhedron and application to polyhedral links
DOI10.1007/S10910-012-9994-9zbMATH Open1321.92086OpenAlexW2078228466MaRDI QIDQ454297FDOQ454297
Authors: Kecai Deng, Jianguo Qian, Fuji Zhang
Publication date: 1 October 2012
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-012-9994-9
Recommendations
Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cites Work
- The number of trees
- Symmetry and combinatorial enumeration in chemistry.
- Title not available (Why is that?)
- Title not available (Why is that?)
- The architecture of platonic polyhedral links
- Title not available (Why is that?)
- The Counting and Coding of Trees of Fixed Diameter
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Enumerating the total colorings of a polyhedron and application to polyhedral links
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454297)