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
2
search results - page 1 / 1
»
Exponentially many 5-list-colorings of planar graphs
Sort
relevance
views
votes
recent
update
View
thumb
title
20
click to vote
JCT
2007
77
views
more
JCT 2007
»
Exponentially many 5-list-colorings of planar graphs
13 years 8 months ago
Download
www.math.u-szeged.hu
We prove that every planar graph with n vertices has at least 2n/9 distinct list-colorings provided every vertex has at least five available colors. © 2006 Elsevier Inc. All rig...
Carsten Thomassen
claim paper
Read More »
26
click to vote
DM
2002
104
views
more
DM 2002
»
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
13 years 8 months ago
Download
users.wpi.edu
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
Brigitte Servatius, Herman Servatius
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »