Access the full text.
Sign up today, get DeepDyve free for 14 days.
Xiaotao Cai (1984)
On the Panconnectivity of Ore GraphScientia Sinica, 27
H. Enomoto (1984)
Long paths and large cycles in finite graphsJ. Graph Theory, 8
B. Jackson (1980)
Hamilton cycles in regular 2-connected graphsJ. Comb. Theory, Ser. B, 29
R. Faudree, R. Schelp (1974)
Path connected graphsActa Mathematica Academiae Scientiarum Hungarica, 25
Xiao-Chao Ca (1984)
ON THE PANCONNECTIVITY OF ORE GRAPHScience in China Series A-Mathematics, Physics, Astronomy & Technological Science, 27
LetG be a simple graph such that the sum of the degrees of any two independent vertices ofG is at leastn−1. We shall prove thatG is [6,n]-panconnected except for four kinds of graphs.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Jul 13, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.