# Search results for: Igor Fabrici

Discrete Mathematics > 2016 > 339 > 11 > 2826-2831

Electronic Notes in Discrete Mathematics > 2016 > 55 > C > 143-146

Discussiones Mathematicae Graph Theory > 2016 > 36 > 3 > 565-575

Discussiones Mathematicae Graph Theory > 2016 > 36 > 1 > 95-102

Discrete Applied Mathematics > 2015 > 185 > Complete > 239-243

Discussiones Mathematicae Graph Theory > 2013 > 33 > 1 > 71-89

Discrete Mathematics > 2007 > 307 > 7-8 > 854-865

Discrete Mathematics > 2007 > 307 > 7-8 > 866-872

Discrete Mathematics > 2002 > 256 > 1-2 > 105-114

Discrete Mathematics > 2000 > 213 > 1-3 > 105-113

Discrete Mathematics > 2000 > 212 > 1-2 > 61-73

Discrete Mathematics > 1998 > 191 > 1-3 > 83-90

Graphs and Combinatorics > 1997 > 13 > 3 > 245-250

*G*either contains a path on

*k*vertices each of which has degree at most 5

*k*or does not contain any path on

*k*vertices; the bound 5

*k*is the best possible. Moreover, for every connected planar graph

*H*other than a path and for every integer

*m*≥ 3 there is a 3-connected planar graph

*G*such that each copy of

*H*in

*G*contains a vertex of degree at least...

Discussiones Mathematicae Graph Theory > 1996 > 16 > 1 > 81-87