Graph data source information

Primary source:

Background sources and references:

• Aichholzer, O. On the Rectilinear Crossing Number. »
• Aldred, R. E. L., et al. "Nonhamiltonian 3-Connected Cubic Planar Graphs." SIAM Journal of Discrete Mathematics 13 (2000): 25–32.
• Aldred, R. E. L., B. D. McKay, and N. C. Wormald. "Small Hypohamiltonian Graphs." Journal of Combinatorial Mathematics and Combinatorial Computing 23 (1997): 143–152.
• Babic, D., et al. "Resistance-Distance Matrix: A Computational Algorithm and Its Applications." International Journal of Quantum Chemistry 90 (2002): 166–176.
• Beresford, R. "Regular Graph Synthesis & Visualization." Mathematica notebook. Pers. comm., May 6, 2004.
• Biggs, N. Algebraic Graph Theory. Cambridge University Press, 1993.
• Brandstädt, A., V. B. Le, and J. P. Spinrad. Graph Classes: A Survey. Society for Industrial Mathematics, 1999.
• Brimkov, V. E., et al. "On the Lovász Number of Certain Circulant Graphs." In Algorithms and Complexity: 4th Italian Conference, CIAC 2000 Rome, Italy, March 1-3, 2000 Proceedings [G. Bongiovanni, G. Gambosi, and R. Petreschi (Eds.)]. Springer, 2000: 291–305.
• Brouwer, A. E. Descriptions of Various Graphs. »
• Brouwer, A. E., A. M. Cohen, and A. Neumaier. Distance-Regular Graphs. Springer-Verlag, 1989.
• Chvátal, V. "Flip-Flops in Hypohamiltonian Graphs." Canadian Mathematical Bulletin 16 (1973): 33–41.
• Colbourn, C. J. and J. H. Dinitz (Eds.). CRC Handbook of Combinatorial Designs. CRC Press, 647–648, 1996.
• Conder, M., et al. "The Ljubljana Graph." CiteSeer^X. »
• Coxeter, H. S. M. "Self-Dual Configurations and Regular Graphs." Bulletin of the American Mathematical Society 56 (1950): 413–455.
• Devillers, J. and A. T. Balaban (Eds.). Topological Indices and Related Descriptors in QSAR and QSPR. CRC Press, 2000.
• Ellis-Monaghan, J. A. and C. Merino. "Graph Polynomials and Their Applications I: The Tutte Polynomial." arXiv:0803.3079v2 (2008). »
• Ellis-Monaghan, J. and C. Merino. "Graph Polynomials and Their Applications II: Interrelations and Interpretations." arXiv:0806.4699v1 (2008). »
• Exoo, G. Rectilinear Drawings of Famous Graphs. »
• Exoo, G. Regular Graphs of Given Degree and Girth. »
• Frucht, R. "A One-Regular Graph of Degree Three." Canadian Journal of Mathematics 4 (1952): 240–247.
• Gallian, J. A. "Dynamic Survey DS6: Graph Labeling." Electronic Journal of Combinatorics DS6 (2007): 1-58. »
• Gerbracht, E. H.-A. "Minimal Polynomials for the Coordinates of the Harborth Graph." arXiv:math/0609360v3 (2006). »
• Gethner, E. and W. M. Springer II. "How False Is Kempe's Proof of the Four-Color Theorem?" Congressus Numerantium 164 (2003): 159–175.
• Guy, R. K. and T. A. Jenkyns. "The Toroidal Crossing Number of K_m,n." Journal of Combinatorial Theory 6 (1969): 235–250.
• Harary, F. Graph Theory. Addison-Wesley, 1969.
• Harary, F., S. Hedetniemi, and R. Robinson. "Erratum to 'Uniquely Colorable Graphs.'" Journal of Combinatorial Theory 9 (1970): 221.
• Harary, F., S. Hedetniemi, and R. Robinson. "Uniquely Colorable Graphs." Journal of Combinatorial Theory 6 (1969): 264–270.
• Hatzel, H. "Ein planarer hypohamiltonscher Graph mit 57 Knoten." Math Annalen 243 (1979): 213–216.
• Ho, P. T. "The Crossing Number of K_4,n on the Real Projective Plane." Discrete Mathematics 304, no. 1–3 (2005): 23–33.
• Kuchel, P. W. Note 96.45 in "Can You 'Bend' a Truncated Truncated Tetrahedron?" The Mathematical Gazette 96 (2012): 317–323.
• Levit, V. E. and E. Mandrescu. "The Independence Polynomial of a Graph—A Survey." In Proceedings of the 1st International Conference on Algebraic Informatics [S. Bozapalidis, A. Kalampakas, and G. Rahonis (Eds.)]., 233–254, 2005.
• Lindgren, W. F. "An Infinite Class of Hypohamiltonian Graphs." American Mathematical Monthly 74 (1967): 1087–1089.
• Lovász, L. "On the Shannon Capacity of a Graph." IEEE Transactions on Information Theory IT-25 (1979): 1–7.
• Marušič, D. and T. Pisanski. "The Gray Graph Revisited." Journal of Graph Theory 35 (2000): 1–7.
• Marušič, D., T. Pisanski, and S. Wilson. "The Genus of the GRAY Graph Is 7." European Journal of Combinatorics 26, no. 3-4 (2005): 377–385.
• McKay, B. "Graphs." Combinatorial Data. »
• Meringer, M. "Connected Regular Graphs." Regular Graphs. »
• Pan, S. and R. B. Richter. "The Crossing Number of K₁₁ is 100." Journal of Graph Theory 56, no. 2 (2007): 128–134.
• Pemmaraju, S. and S. Skiena. Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge University Press, 2003.
• Pemmaraju, S. and S. Skiena. Computational Graph Theory with Combinatorica. »
• Pisanski, T. and M. Randić. "Bridges between Geometry and Graph Theory." In Geometry at Work: A Collection of Papers Showing Applications of Geometry [Gorini, C. A. (Ed.)]. Mathematical Association of America, 2000: 174-194.
• Rajasekaran, S. and D. S. L. Wei. "Selection, Routing, and Sorting on the Star Graph." Journal of Parallel and Distributed Computing 41, no. 2 (1997): 225–233.
• Read, R. C. and R. J. Wilson. An Atlas of Graphs. Oxford University Press, 1998.
• Research Group on Graph Theory and Combinatorics. Applied Mathematics IV Department of the Universitat Politècnica de Catalunya. "The (Degree, Diameter) Problem for Graphs." Research Group on Graph Theory and Combinatorics. »
• Royle, G. "Cages of Higher Valency." Combinatorial Catalogues. »
• Royle, G. "Cubic Cages." Combinatorial Catalogues. »
• Royle, G. "Cubic Symmetric Graphs (The Foster Census)." Combinatorial Catalogues. »
• Royle, G. "Snarks." Combinatorial Catalogues. »
• Séquin, C. H. "Symmetrical Hamiltonian Manifolds on Regular 3D and 4D Polytopes." In Proceedings of Coxeter Day, 463–472, 2005.
• Skiena, S. A Database of Graphs in Combinatorica Format. »
• Spence, E. Strongly Regular Graphs on at Most 64 Vertices. »
• Thomassen, C. "Hypohamiltonian and Hypotraceable Graphs." Discrete Mathematics 9 (1974): 91–96.
• Thomassen, C. "On Hypohamiltonian Graphs." Discrete Mathematics 10 (1974): 383–390.
• Thomassen, C. "Planar and Infinite Hypohamiltonian and Hypotraceable Graphs." Discrete Mathematics 14 (1976): 377–389.
• Thomassen, C. "Planar Cubic Hypohamiltonian and Hypotraceable Graphs." Journal of Combinatorial Theory, Series B 30 (1981): 36–44.
• Tutte, W. T. "A Family of Cubical Graphs." In Proceedings of the Cambridge Philosophical Society 43 459–474, 1947.
• Van Dam, E. R. and W. H. Haemers. "Which Graphs Are Determined by Their Spectrum?" Linear Algebra and Its Applications 373 (2003): 241–272.
• Wagon, S. Mathematica in Action. (2nd ed.) Springer-Verlag, 1991.
• Wagon, S. Chromatic and edge chromatic numbers of graphs. Personal communication, Oct. 2011.
• Weisstein, E. W. MathWorld—A Wolfram Web Resource. »
• West, D. B. Introduction to Graph Theory. Prentice Hall, Inc., 1996.
• Zamfirescu, T. "On Longest Paths and Circuits in Graphs." Mathematica Scandinavica 38 (2007): 211–239.
• Zamfirescu, C. T. and T. I. Zamfirescu. "A Planar Hypohamiltonian Graph with 48 Vertices." Journal of Graph Theory 55 (2007): 338–342.

Note: This list is intended as a guide to sources and further information. The inclusion of an item in this list does not necessarily mean that its content was used as the basis for any specific Wolfram|Alpha result. Requests by researchers for detailed information on the sources for individual results can be directed here »