384 search results - page 44 / 77 » On s-hamiltonian-connected line graphs |
104
Voted
GD
2008
Springer
15 years 1 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
91
Voted
CG
2004
Springer
15 years 10 days ago
2004
Springer
nd maps are powerful abstractions. Their combination, Hierarchical Graph Maps, provide effective tools to process a graph that is too large to fit on the screen. They provide hier...
119
click to vote
SASO
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
71
Voted
DM
2008
15 years 16 days ago
2008
We show that the conjectures by Matthews and Sumner (every 4-connected claw-free graph is hamiltonian), by Thomassen (every 4-connected line graph is hamiltonian) and by Fleischne...
GD
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small ...