2006/01/31 by Josep M. Brunat, Antônio Montes, Antonio Montes
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Graph theory and applications #Polynomial and algebraic computation #math.AC #math.CO #msc:05C75 #msc:14H05 #msc:14H99
paper · pdf · doi:10.1016/j.disc.2006.01.001
published as Discrete Math. (2006), 306/4, p 401-412 · 13 pages, 6 figures, See also http://www-ma2.upc.edu/~montes/
arxiv created 2006/01/31 · openalex publication_date 2006/02/10 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/02
Let Φ(x,y) be a bivariate polynomial with complex coefficients. The zeroes of Φ(x,y) are given a combinatorial structure by considering them as arcs of a directed graph G(Φ). This paper studies some relationship between the polynomial Φ(x,y) and the structure of G(Φ).