#### Filter Results:

#### Publication Year

1992

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ludovít Niepel, Martin Knor, Lubomír Soltés
- Ars Comb.
- 1996

- William Klostermeyer, Lubomír Soltés
- Journal of Graph Theory
- 1998

- Lubomír Soltés
- Discrete Mathematics
- 1994

- Hong-Jian Lai, Lubomír Soltés
- J. Comb. Theory, Ser. B
- 2001

Beineke and Robertson independently characterized line graphs in terms of nine forbidden induced subgraphs. In 1994, S8 olte s gave another characterization, which reduces the number of forbidden induced subgraphs to seven, with only five exceptional cases. A graph is said to be a dumbbell if it consists of two complete graphs sharing exactly one common… (More)

- William Klostermeyer, Lubomír Soltés
- Discrete Mathematics
- 2000

The eeects of the vertex push operation (when a vertex is pushed, the direction of each of its incident arcs is reversed) on the connec-tivity of tournaments are studied. It is shown that there exists an n k such that any tournament with n vertices, n n k , can be made k-strongly connected using pushes, for any k 1. These results imply, for example, that… (More)

- Guantao Chen, Ralph J. Faudree, Lubomír Soltés
- Discrete Mathematics
- 2010

- Guantao Chen, Richard H. Schelp, Lubomír Soltés
- Journal of Graph Theory
- 1997

- Yusheng Li, Cecil C. Rousseau, Lubomír Soltés
- Discrete Mathematics
- 1997

- M Knor, L Niepel, L ˇ Soltés
- 1992

For a graph G such that L 2 (G) is not empty, we construct a supergraph H such that C(L i (H)) = L i (G) for all i, 0≤i≤2. Here L i (G) denotes the i-iterated line graph of G and C(G) denotes the subgraph of G induced by central nodes. This result is, in a sense, best possible since we provide an infinite class of graphs G such that L i (G) = C(L i (H)) for… (More)

- Arun K. Jagota, Giri Narasimhan, Lubomír Soltés
- Discrete Applied Mathematics
- 2001