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
12
click to vote
ARSCOM
2006
favorite
Email
discuss
report
66
views
more
ARSCOM 2006
»
Cycle decompositions of the complete graph
13 years 4 months ago
Download
www.personal.reading.ac.uk
Anthony J. W. Hilton, Matthew Johnson
Real-time Traffic
ARSCOM 2006
|
claim paper
Related Content
»
An asymptotic solution to the cycle decomposition problem for complete graphs
»
Nomadic decompositions of bidirected complete graphs
»
Further decompositions of complete tripartite graphs into 5cycles
»
Large sets of Hamilton cycle decompositions of complete bipartite graphs
»
Packing 5cycles into balanced complete m partite graphs for odd m
»
All graphs with maximum degree three whose complements have 4cycle decompositions
»
The Directed AntiOberwolfach Solution Pancyclic 2Factorizations of Complete Directed Graph...
»
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
»
Hamiltonian decompositions of complete kuniform hypergraphs
more »
Post Info
More Details (n/a)
Added
10 Dec 2010
Updated
10 Dec 2010
Type
Journal
Year
2006
Where
ARSCOM
Authors
Anthony J. W. Hilton, Matthew Johnson
Comments
(0)
Researcher Info
ARSCOM 2008 Study Group
Computer Vision