Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ARSCOM
2004

favoriteEmaildiscussreport

73views more ARSCOM 2004»

2-Factors in Hamiltonian Graphs

13 years 4 months ago

2-Factors in Hamiltonian Graphs

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

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)