Supertough graphs need not be K1,3-free

Australasian Journal of Combinatorics

Volumn 32, Issue , 2005, Pages 91-103

  Doty, Lynne L ^a   Ferland, Kevin K ^b  

^a MARIST COLLEGE   (United States)

^b BLOOMSBURG UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 44449118065     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. V. Chvátal, Tough graphs and hamiltonian circuits, Discrete Math. 5 (1973), 215-228.
2. G. A. Dirac, A theorem of R. L. Brooks and a conjecture of H. Hadwiger, Proc. London Math. Soc. 7 (1957), 161-195.
3. L. L. Doty, A large class of maximally tough graphs, OR Spektrum 13 (1991), 147-151.
4. L. L. Doty and K. K. Ferland, Maximally tough cubic graphs, Congressus Numerantium, to appear.
5. K. K. Ferland, Maximum toughness among (n, m)-graphs, J. Combin. Math. Combin. Comput. 43 (2002), 43-55.
6. K. K. Ferland, The maximum toughness of sesqui-cubic graphs, J. Combin. Math. Combin. Comput. 44 (2003), 129-144.
7. W. D. Goddard and Henda C. Swart, On some extremal problems in connectivity, Graph Theory, Combinatorics, and Applications, vol. 1, Wiley, New York, 1991, pp. 535-551.
8. F. Harary, The maximum connectivity of a graph, Proceedings of the National Academy of Science 48 (1962), 1142-1146.
9. B. Jackson and P. Katerinis, A characterization of 3/2-tough graphs, Ars Combinatoria 38 (1994), 145-148.
10. 1,3-free graphs, Journal of Graph Theory 8 (1984), 139-146.
11. Douglas B. West, Introduction to graph theory, second ed., Prentice Hall, Providence, RI, 2001.