A special case of resolving polynomials

DOI10.1007/S10559-015-9765-2MaRDI QIDQ904423zbMATH OpenOpenAlexFDO

Authors 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

planar graphpolynomialenumeration of combinationsHamiltonian looploop partition

Mathematics Subject Classification ID

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

Recommendations

• Resolution of P(x,y)=0
• Subdivision methods for solving polynomial equations
• On solving systems of bivariate polynomials
• Solving polynomial systems in integers
• An approach to solving systems of polynomials via modular arithmetics with applications

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

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