Abstract
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the problem is presented, with several new results for graphs whose gracefulness was previously unknown. Several classes of graph that are conjectured to be graceful only for small instances are investigated: after a certain size, it appears that for some of these classes the search to prove that there is no graceful labelling is essentially the same for each successive instance. The possibility of constructing a proof of the conjecture based on the search is discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beldiceanu, N.: Global constraints as graph properties on structured network of elementary constraints of the same type. Technical Report Technical Report T2000/01, SICS (2000)
Bermond, J.C., Farhi, G.: Sur un problème combinatoire d’antennes en radioastronomie II. Annals of Discrete Mathematics 12, 49–53 (1982)
Beutner, D., Harborth, H.: Graceful labelings of nearly complete graphs. Results in Mathematics 41, 34–39 (2002)
Bundy, A.: A Very Mathematical Dilemma. Computer Journal (in press, 2006)
Crawford, J., Ginsberg, M., Luks, E., Roy, A.: Symmetry-Breaking Predicates for Search Problems. In: Proceedings KR 1996, pp. 149–159 (November 1996)
Gallian, J.A.: A Dynamic Survey of Graph Labeling (DS6), 9th edn. The Electronic Journal of Combinatorics (2005)
Gent, I.P., Smith, B.M.: Symmetry Breaking During Search in Constraint Programming. In: Horn, W. (ed.) Proceedings ECAI 2000, the European Conference on Artificial Intelligence, pp. 599–603 (2000)
Golomb, S.W.: How to number a graph. In: Read, R.C. (ed.) Graph Theory and Computing, pp. 23–37. Academic Press, London (1972)
Law, Y.C., Lee, J.H.M.: Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction. Constraints 11, 221–267 (2006)
Lustig, I.J., Puget, J.-F.: Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming. INTERFACES 31(6), 29–53 (2001)
Petrie, K.E., Smith, B.M.: Symmetry Breaking in Graceful Graphs. Technical Report APES-56-2003 APES Research Group (2003), Available from: http://www.dcs.st-and.ac.uk/~apes/apesreports.html
Puget, J.-F.: Breaking symmetries in all different problems. In: Proceedings of IJCAI 2005, pp. 272–277 (2005)
Smith, B., Petrie, K.: Graceful Graphs: Results from Constraint Programming (2003), http://4c.ucc.ie/~bms/Graceful/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smith, B.M. (2006). Constraint Programming Models for Graceful Graphs. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_39
Download citation
DOI: https://doi.org/10.1007/11889205_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)