384 search results - page 8 / 77 » On s-hamiltonian-connected line graphs |
APPML
2011
13 years 2 months ago
2011
CORR
2011
Springer
12 years 11 months ago
2011
Springer
GD
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
JCT
2010
13 years 5 months ago
2010
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
WG
2010
Springer
13 years 5 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...