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

» 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

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)

Sciweavers

General neighbour-distinguishing index of a graph

Colours | DM 2008 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers