1605 search results - page 132 / 321 » On Partitional Labelings of Graphs |
122
Voted
JGT
2007
15 years 15 days ago
2007
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...
90
Voted
CORR
2004
Springer
15 years 14 days ago
2004
Springer
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...
103
Voted
DM
1999
15 years 8 days ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
138
click to vote
WAW
2010
Springer
14 years 10 months ago
2010
Springer
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
130
Voted
FLAIRS
2006
15 years 2 months ago
2006
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...