#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1998

2017

- This year (1)
- Last 5 years (8)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Robert Johansson
- Journal of Graph Theory
- 1998

Let G be a connected n{order graph and suppose that n = n 1 + + n k where n i 2 are integers. The following will be proved : If G has minimum degree at least 1 2 n 1 + + 1 2 n k then G has a spanning subgraph which consists of paths of orders n 1 ; : : : ; n k .

- Robert Johansson, Alessandro Saffiotti
- 2009 IEEE International Conference on Robotics…
- 2009

Stigmergy is a mechanism that allows the coordination of actions within the same agent or across different agents by means of traces left in the environment. We propose a stigmergetic approach to robot navigation in which a robot sets values in a hexagonal grid of RFID tags buried under the floor. This approach only requires minimal resources on the robot.… (More)

- Robert Johansson
- Discrete Mathematics
- 2000

Let G be a 3-partite graph with 3n vertices, n in each class, such that each vertex is connected to at least 2 3 n + 2 √ n of the vertices in each of the other two classes. We prove that G contains n independent triangles.

- Munhamo Chisvo, David Tschirley, Michael T. Weber, David Soroko, Robert Johansson, Paula Santos
- 1999

Editors The MSU International Development Paper series is designed to further the comparative analysis of international development activities in Africa, Latin America, Asia, and the Near East. The papers report research findings on historical, as well as contemporary, international development problems. The series includes papers on a wide range of topics,… (More)

- Evgeny K. Akhmedov, Robert Johansson, Manfred Lindner, Tommy Ohlsson, Thomas Schwetz
- 2004

We present a number of complete sets of series expansion formulas for neutrino oscillation probabilities in matter of constant density for three flavors. In particular, we study expansions in the mass hierarchy parameter α ≡ ∆m 2 21 /∆m 2 31 and mixing parameter s 13 ≡ sin θ 13 up to second order and expansions only in α and only in s 13 up to first order.… (More)

We show how to apply the Leggett-Garg inequality to opto-electro-mechanical systems near their quantum ground state. We find that by using a dichotomic quantum nondemolition measurement (via, e.g., an additional circuit-QED measurement device), either on the cavity or on the nano-mechanical system itself, the Leggett-Garg inequality is violated. We argue… (More)

- Robert Johansson, A. Storm, +17 authors D. Perks
- ISSCC
- 2011

- Robert Johansson
- Discrete Mathematics
- 2000

A special case of a conjecture of M. El-Zahár states that a graph G with 2k vertices and minimum degree k, contains every bipartite 2-regular graph H on 2k vertices as a spanning subgraph. In this paper it will be proved that G contains the union of (k − 1) cycles of lengths 4 and a path of order 4. Using this result it will also be proved that G contains… (More)

- Roland Häggkvist, Robert Johansson
- Discrete Mathematics
- 2004

We give conditions for different classes of planar graphs to be decom-posable into paths of length 3.

The Dicke model describes N qubits ͑or two-level atoms͒ homogeneously coupled to a bosonic mode. Here we examine an open-system realization of the Dicke model, which contains critical and chaotic behaviors. In particular, we extend this model to include an additional open transport qubit ͑coupled to the bosonic mode͒ for passive and active measurements. We… (More)