Wolfram Knowledgebase™
Source information & attribution

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.

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 »