
Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Graph Theory (G.2.2) > Graph Labeling (G.2.2...)









16 of 6
Reviews about "Graph Labeling (G.2.2...)":

Date Reviewed 

An asymptotic version of the multigraph 1factorization conjecture Vaughan E. Journal of Graph Theory 72(1): 1929, 2013. Type: Article
A multigraph is a graph in which two vertices are contained in more than one edge, but loops are not allowed. A set of edges is parallel if all of its edges contain the same two vertices. The size of the largest parallel set of edges i...

Mar 29 2013 

Hadwiger’s conjecture for proper circular arc graphs Belkale N., Chandran L. European Journal of Combinatorics 30(4): 946956, 2009. Type: Article
The arcs of a circle represent the vertex sets of circular graphs: “Two vertices are adjacent if and only if their corresponding arcs intersect.” A circular graph is proper if no arc representing a vertex is contain...

Sep 28 2009 

Equitable colorings of bounded treewidth graphs Bodlaender H., Fomin F. Theoretical Computer Science 349(1): 2230, 2005. Type: Article
Bodlaender and Fomin prove that an equitable kcoloring can be found in polynomial time on graphs of bounded treewidth. It follows that an lbounded kcoloring also has a polynomial solution on graphs of bounded tr...

Jul 10 2006 

Distance labeling in graphs Gavoille C., Peleg D., Pérennes S., Raz R. Journal of Algorithms 53(1): 85112, 2004. Type: Article
This paper mainly addresses the problem of efficiently labeling graphs in such a way that the distance between two nodes of the graph can be computed only from their labels. Of course, it is desirable to have the maximum length of a la...

Jan 26 2005 

Graph recurrence: how to write them and why Vince A. European Journal of Combinatorics 24(1): 1532, 2003. Type: Article
Two graphs are isomorphic when one can be transformed into the other by renaming its vertices. Polynomial time algorithms exist for determining isomorphism, but only for some graph types. In general, however, it is not known whether th...

Jul 2 2003 

Bounding the bandwidths for graphs Zhou S. Theoretical Computer Science 249(2): 357368, 2000. Type: Article
Let G and H be finite graphs, and suppose that H has at least as many vertices as G. The bandwidth of G with respect to H...

Apr 22 2002 





