#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1993

2015

- This year (0)
- Last 5 years (3)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

- Martin Knor, Ludovít Niepel, Maryam Malah
- Australasian J. Combinatorics
- 2000

We prove a necessary and sufficient condition under which a connected graph has a connected P3-path graph. Moreover, an analogous condition for connectivity of the Pk-path graph of a connected graph which does not contain a cycle of length smaller than k+1 is derived.

- Martin Knor, Ludovít Niepel
- Computers and Artificial Intelligence
- 2004

- Martin Knor, Ludovít Niepel
- Discrete Applied Mathematics
- 2003

- Ludovít Niepel, Anton Cerný
- Computing and Informatics
- 2008

- Martin Knor, Ludovít Niepel
- Discrete Mathematics
- 2001

- Thomas Böhme, Martin Knor, Ludovít Niepel
- Discrete Mathematics
- 2006

We prove that for every graph H with the minimum degree 5, the third iterated line graph L3(H) of H contains K √ −1 as a minor. Using this fact we prove that if G is a connected graph distinct from a path, then there is a number kG such that for every i kG the i-iterated line graph of G is 1 2 (L i(G))-linked. Since the degree of Li(G) is even, the result… (More)

- Ludovít Niepel, Martin Knor
- Discrete Applied Mathematics
- 2009

- Martin Knor, Ludovít Niepel
- Journal of Graph Theory
- 2006

- Mohammad Ghebleh, Ludovít Niepel
- Discrete Applied Mathematics
- 2013

A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or it has a neighbour in S. In other words S is dominating if the sets S ∩N [u] where u ∈ V (G) and N [u] denotes the closed neighbourhood of u in G, are all nonempty. A set S ⊆ V (G) is called a locating code in G, if the sets S ∩ N [u] where u ∈ V (G) \ S are… (More)