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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
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
103
Voted
DAM
2011
209
views
Theoretical Computer Science
»
more
DAM 2011
»
1-factor covers of regular graphs
14 years 9 months ago
Download
orion.math.iastate.edu
sarah-marie belcastro, Michael Young
Real-time Traffic
DAM 2011
|
Theoretical Computer Science
|
claim paper
Related Content
»
On minimum sets of 1factors covering a complete multipartite graph
»
Counting 1Factors in Regular Bipartite Graphs
»
r r1factorizations of d d1graphs
»
A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs
»
Multiple Kronecker covering graphs
»
Covering TwoEdgeColoured Complete Graphs with Two Disjoint Monochromatic Cycles
»
Sampling Edge Covers in 3Regular Graphs
»
Counting in Graph Covers A Combinatorial Characterization of the Bethe Entropy Function
»
On almost selfcomplementary graphs
more »
Post Info
More Details (n/a)
Added
13 May 2011
Updated
13 May 2011
Type
Journal
Year
2011
Where
DAM
Authors
sarah-marie belcastro, Michael Young
Comments
(0)
Researcher Info
DAM 2010 Study Group
Computer Vision