6740 search results - page 15 / 1348 » An s -Hamiltonian Line Graph Problem |
COMBINATORICS
1999
13 years 7 months ago
1999
Let k denote the maximum degree of the kth iterated line graph Lk(G). For any connected graph G that is not a path, the inequality k+1 2k - 2 holds. Niepel, Knor, and Solt
JGT
2007
13 years 7 months ago
2007
Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-fa...
VL
1994
IEEE
13 years 11 months ago
1994
IEEE
In this paper we discuss 3D rendering as a solution to the line crossing problem associated with using connecting lines for illustrating relations in visual programming. The Bezie...
JGT
2011
13 years 2 months ago
2011
IPL
2007
13 years 7 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...