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
22
Voted
DM
2008
favorite
Email
discuss
report
95
views
more
DM 2008
»
General neighbour-distinguishing index of a graph
13 years 11 months ago
Download
www.renyi.hu
It is proved that edges of a graph G with no component K2 can be coloured using at most 2 log2 (G) + 1 colours so that any two adjacent vertices have distinct sets of colours of their incident edges.
Ervin Györi, Mirko Hornák, Cory Palmer
Real-time Traffic
Colours
|
DM 2008
|
claim paper
Related Content
»
ClosureTree An Index Structure for Graph Queries
»
Towards Graph Containment Search and Indexing
»
DkIndex An Adaptive Structural Summary for GraphStructured Data
»
MTree an XML XPath graph index
»
Hierarchical graph indexing
»
Largescale malware indexing using functioncall graphs
»
Indexing and mining topological patterns for drug discovery
»
Reachability Indexes for Relational Keyword Search
»
Fgindex towards verificationfree query processing on graph databases
more »
Post Info
More Details (n/a)
Added
10 Dec 2010
Updated
10 Dec 2010
Type
Journal
Year
2008
Where
DM
Authors
Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak
Comments
(0)
Researcher Info
DM 1998 Study Group
Computer Vision