Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
19
click to vote
JCT
2006
favorite
Email
discuss
report
64
views
more
JCT 2006
»
Every 3-connected, essentially 11-connected line graph is Hamiltonian
13 years 8 months ago
Download
www.math.wvu.edu
Thomassen conjectured that every 4-connected line graph is hamiltonian. A vertex cut X of G is essential if G-X has at least two nontrivial components. We prove that every 3-connected, essentially 11-connected line graph is hamiltonian. Using Ryj
Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou
Real-time Traffic
4-connected Line Graph
|
Claw-free Graph
|
JCT 2006
|
Line Graph
|
claim paper
Post Info
More Details (n/a)
Added
13 Dec 2010
Updated
13 Dec 2010
Type
Journal
Year
2006
Where
JCT
Authors
Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou
Comments
(0)
Researcher Info
JCT 2008 Study Group
Computer Vision