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
720
search results - page 62 / 144
»
Nonrepetitive colorings of graphs
Sort
relevance
views
votes
recent
update
View
thumb
title
17
click to vote
COMBINATORICS
2002
67
views
more
COMBINATORICS 2002
»
Sparse Graphs Usually Have Exponentially Many Optimal Colorings
13 years 7 months ago
Download
www.combinatorics.org
Michael Krivelevich
claim paper
Read More »
20
click to vote
CORR
2002
Springer
117
views
Education
»
more
CORR 2002
»
On the graph coloring check-digit scheme with applications to verifiable secret sharing
13 years 7 months ago
Download
www.ippt.gov.pl
Kamil Kulesza, Zbigniew Kotulski
claim paper
Read More »
20
click to vote
EJC
2002
84
views
Information Technology
»
more
EJC 2002
»
On the Number of 3-Edge Colorings of Cubic Graphs
13 years 7 months ago
Download
www.cadence.com
Christian Szegedy
claim paper
Read More »
20
click to vote
HEURISTICS
2002
70
views
more
HEURISTICS 2002
»
Constraint Propagation in Graph Coloring
13 years 7 months ago
Download
www.iac.rm.cnr.it
Massimiliano Caramia, Paolo Dell'Olmo
claim paper
Read More »
17
click to vote
COMBINATORICS
1998
81
views
more
COMBINATORICS 1998
»
An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs
13 years 7 months ago
Download
www.combinatorics.org
Michael Krivelevich
claim paper
Read More »
« Prev
« First
page 62 / 144
Last »
Next »