Abstract
In Chap. 6 we discussed the existence of labelings by utilizing the ⊗ h -product of digraphs, which could be expressed algebraically as a generalization of voltage assignments, a classical technique used in topological graph theory. In this chapter, we introduce an algebraic method: Combinatorial Nullstellensatz.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alon, N.: Combinatorial Nullstellensatz. Comb. Probab. Comput. 8, 7–29 (1999)
Alon, N., Tarsi, M.: Colorings and orientations of graphs. Combinatorica 12, 125–134 (1992)
Càmara, M., Lladó, A., Moragas, J.: On a conjecture of Graham and Häggkvist with the polynomial method. Eur. J. Comb. 34, 1585–1592 (2013)
Dyson, F.J.: Statistical theory of the energy levels of complex systems I. J. Math. Phys. 3, 140–156 (1962)
Gunson, J.: Proof of a conjecture of Dyson in the statistical theory of energy levels. J. Math. Phys. 3, 752–753 (1962)
Häggkvist, R.L.: Decompositions of complete bipartite graphs. In: Surveys in Combinatorics, pp. 115–146. Cambridge University Press, Cambridge (1989)
Hartsfield, N., Ringel, G.: Pearls in Graph Theory. A Comprehensive Introduction. Academic, Boston (1990)
Hefetz, D.: Anti-magic graphs via the Combinatorial Nullstellensatz. J. Graph Theory 50, 263–272 (2005). http://dx.doi.org/10.1002/jgt.20112
Kézdy, A.E.: ρ-valuations for some stunted trees. Discrete Math. 306, 2786–2789 (2006). http://dx.doi.org/10.1016/j.disc.2006.05.026
Kotzig, A.: On certain vertex-valuations of finite graphs. Utilitas Math. 4, 261–290 (1973)
Lladó, A., López, S.C.: Edge-decompositions of K n, n into isomorphic copies of a given tree. J. Graph Theory 48, 1–18 (2005). http://dx.doi.org/10.1002/jgt.20024
Lladó, A., López, S.C., Moragas, J.: Every tree is a large subtree of a tree that decomposes K n or K n, n . Discret. Math. 310, 838–842 (2010). http://dx.doi.org/10.1016/j.disc.2009.09.021
Lladó, A., Ringel, G., Serra, O.: Decomposition of complete bipartite graphs into trees. Tech. Rep. DMAT Research Report 11/96, Universitat Politècnica de Catalunya (1996)
Lo, S.: On edge-graceful labelings of graphs. Congr. Numer. 50, 231–241 (1985)
Rosa, A.: On certain valuations of the vertices of a graph. In: Theory of Graphs (Internat. Symposium, Rome, July 1966), pp. 349–355. Gordon and Breach, New York; Dunod, Paris (1967)
Wilson, K.: Proof of a conjecture of Dyson. J. Math. Phys. 3, 1040–1043 (1962)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 The Author(s)
About this chapter
Cite this chapter
López, S.C., Muntaner-Batle, F.A. (2017). The Polynomial Method. In: Graceful, Harmonious and Magic Type Labelings. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-52657-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-52657-7_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-52656-0
Online ISBN: 978-3-319-52657-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)