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
21
click to vote
ARSCOM
2004
favorite
Email
discuss
report
73
views
more
ARSCOM 2004
»
2-Factors in Hamiltonian Graphs
13 years 7 months ago
Download
www.math.uni-rostock.de
We show that every hamiltonian claw-free graph with a vertex x of degree d(x) 7 has a 2-factor consisting of exactly two cycles.
Florian Pfender
Real-time Traffic
ARSCOM 2004
|
Claw-free
|
Hamiltonian Claw-free Graph
|
claim paper
Related Content
»
Primitive 2factorizations of the complete graph
»
Properly Coloured Hamiltonian Paths in Edgecoloured Complete Graphs
»
Independent dominating sets and hamiltonian cycles
»
Even subgraphs of bridgeless graphs and 2factors of line graphs
»
The upper bound of the number of cycles in a 2factor of a line graph
»
Pseudo 2factor isomorphic regular bipartite graphs
»
Forbidden subgraphs and the existence of a 2factor
»
Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum
»
Eliminating graphs by means of parallel knockout schemes
more »
Post Info
More Details (n/a)
Added
16 Dec 2010
Updated
16 Dec 2010
Type
Journal
Year
2004
Where
ARSCOM
Authors
Florian Pfender
Comments
(0)
Researcher Info
ARSCOM 2008 Study Group
Computer Vision