A special case of resolving polynomials

DOI10.1007/s10559-015-9765-2zbMath1329.05089OpenAlexW2267724025MaRDI QIDQ904423

V. B. Pavlenko

Publication date: 13 January 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-015-9765-2

zbMATH Keywords

polynomialplanar graphenumeration of combinationsHamiltonian looploop partition

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A special case of resolving polynomials