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
149
click to vote
JGT
2010
135
views
more
JGT 2010
»
Cycle length parities and the chromatic number
15 years 1 months ago
Download
www.tu-ilmenau.de
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
Christian Löwenstein, Dieter Rautenbach, Ingo
Real-time Traffic
Chromatic Number
|
JGT 2010
|
claim paper
Related Content
»
Strong oriented chromatic number of planar graphs without cycles of specific lengths
»
Choosability of toroidal graphs without short cycles
»
Integer Functions on the Cycle Space and Edges of a Graph
»
Chromatic capacity and graph operations
more »
Post Info
More Details (n/a)
Added
28 Jan 2011
Updated
28 Jan 2011
Type
Journal
Year
2010
Where
JGT
Authors
Christian Löwenstein, Dieter Rautenbach, Ingo Schiermeyer
Comments
(0)
Researcher Info
JGT 2006 Study Group
Computer Vision