5 search results - page 1 / 1 » Line graphs of multigraphs and Hamilton-connectedness of cla... |
WG
2005
Springer
14 years 28 days ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
JGT
2011
13 years 2 months ago
2011
DM
2007
13 years 7 months ago
2007
By Petersen’s theorem, a bridgeless cubic multigraph has a 2-factor. H. Fleischner generalised this result to bridgeless multigraphs of minimum degree at least three by showing ...
ISPAN
2005
IEEE
14 years 1 months ago
2005
IEEE
For a given graph G = (V, E) and a positive integer k, the super line graph of index k of G is the graph Sk(G) which has for vertices all the k-subsets of E(G), and two vertices S...
TROB
2008
13 years 7 months ago
2008
In formation-maintenance (formation control) tasks, robots maintain their relative position with respect to their peers, according to a desired geometric shape. Previous work has e...