JGT
2008
13 years 5 months ago
2008
JGT
2008
13 years 5 months ago
2008
We prove that the rank-width of the incidence graph of a graph G is either equal to or exactly one less than the branch-width of G, unless the maximum degree of G is
JGT
2008
13 years 5 months ago
2008
The square G2 of a graph G is the graph with the same vertex set as G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that for a planar graph ...
JGT
2008
13 years 5 months ago
2008
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
JGT
2008
13 years 5 months ago
2008
Mader conjectured that for all there is an integer + ( ) such that every digraph of minimum outdegree at least + ( ) contains a subdivision of a transitive tournament of order . In...
JGT
2008
13 years 5 months ago
2008
JGT
2008
13 years 5 months ago
2008
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance fro...
JGT
2008
13 years 5 months ago
2008
JGT
2008
13 years 5 months ago
2008
We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length.