Polynomial-time partition of a graph into cliques.
Plotnikov, Anatoly D. (1996)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Plotnikov, Anatoly D. (1996)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Jakimczuk, Rafael (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Michel Las Vergnas (1999)
Annales de l'institut Fourier
Similarity:
We study the basic algebraic properties of a 3-variable Tutte polynomial the author has associated with a morphism of matroids, more precisely with a matroid strong map, or matroid perspective in the present paper, or, equivalently by the Factorization Theorem, with a matroid together with a distinguished subset of elements. Most algebraic properties of the usual 2-variable Tutte polynomial of a matroid generalize to the 3-variable polynomial. Among specific properties we show that the...
Dohmen, Klaus, Poenitz, André, Tittmann, Peter (2003)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Umberto Zannier (2007)
Acta Arithmetica
Similarity:
R. Ger (1971)
Annales Polonici Mathematici
Similarity:
Jason Lucier (2006)
Acta Arithmetica
Similarity:
Luís R. A. Finotti (2009)
Acta Arithmetica
Similarity:
J. Siciak (1971)
Annales Polonici Mathematici
Similarity:
Norbert Hegyvári, François Hennecart (2009)
Acta Arithmetica
Similarity:
V. L. Deshpande, V. M. Bhise (1970)
Matematički Vesnik
Similarity:
Hong Bing Yu (2001)
Acta Arithmetica
Similarity:
Fedor Petrov (2014)
Acta Arithmetica
Similarity:
Applying techniques similar to Combinatorial Nullstellensatz we prove a lower estimate of |f(A,B)| for finite subsets A, B of a field, and a polynomial f(x,y) of the form f(x,y) = g(x) + yh(x), where the degree of g is greater than that of h.
A. Schinzel (2008)
Acta Arithmetica
Similarity:
Umberto Zannier (2009)
Acta Arithmetica
Similarity: