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
31
click to vote
JCT
2007
favorite
Email
discuss
report
93
views
more
JCT 2007
»
The circular chromatic index of graphs of high girth
14 years 15 days ago
Download
www.math.nsysu.edu.tw
We show that for each ε > 0 and each integer ∆ ≥ 1, there exists a number g such that for any graph G of maximum degree ∆ and girth at least g, the circular chromatic index of G is at most ∆ + ε.
Tomás Kaiser, Daniel Král, Riste Skr
Real-time Traffic
Circular Chromatic Index
|
Integer
|
JCT 2007
|
Maximum Degree
|
claim paper
Post Info
More Details (n/a)
Added
15 Dec 2010
Updated
15 Dec 2010
Type
Journal
Year
2007
Where
JCT
Authors
Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu
Comments
(0)
Researcher Info
JCT 2008 Study Group
Computer Vision