History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 74 total

The potential of greed for independence. (English)
J. Graph Theory 71, No. 3-4, 245-259 (2012).
1
Closures, cycles, and paths. (English)
J. Graph Theory 69, No. 3-4, 314-323 (2012).
2
Nonrepetitive vertex colorings of graphs. (English)
Discrete Math. 312, No. 2, 374-380 (2012).
3
A lower bound on independence in terms of degrees. (English)
Discrete Appl. Math. 159, No. 10, 966-970 (2011).
4
Upper bounds on the sum of powers of the degrees of a simple planar graph. (English)
J. Graph Theory 67, No. 2, 112-123 (2011).
5
Independence in connected graphs. (English)
Discrete Appl. Math. 159, No. 1, 79-86 (2011).
6
Upper bounds on the sum of powers of the degrees of a simple planar graph (English)
Journal of Graph Theory 67, No. 2, 112-123 (2011).
7
Random procedures for dominating sets in bipartite graphs. (English)
Discuss. Math., Graph Theory 30, No. 2, 277-288 (2010).
8
Random procedures for dominating sets in graphs. (English)
Electron. J. Comb. 17, No. 1, Research Paper R102, 15 p., electronic only (2010).
9
Packing disjoint cycles over vertex cuts. (English)
Discrete Math. 310, No. 13-14, 1974-1978 (2010).
10
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. (English)
Discrete Math. 310, No. 9, 1491-1494 (2010).
11
Packing edge-disjoint cycles in graphs and the cyclomatic number. (English)
Discrete Math. 310, No. 9, 1456-1462 (2010).
12
Random procedures for dominating sets in bipartite graphs (English)
Discussiones Mathematicae Graph Theory 30, No. 2, 277-288 (2010).
13
On Hamiltonian cycles through prescribed edges of a planar graph (English)
CTW, 79-82 (2010).
14
On ${\cal F}$-independence in graphs. (English)
Discuss. Math., Graph Theory 29, No. 2, 377-383 (2009).
15
A generalization of Tutte’s theorem on Hamiltonian cycles in planar graphs. (English)
Discrete Math. 309, No. 15, 4949-4951 (2009).
16
Domination in bipartite graphs. (English)
Discrete Math. 309, No. 1, 113-122 (2009).
17
On $F$-independence in graphs (English)
Discussiones Mathematicae Graph Theory 29, No. 2, 377-383 (2009).
18
On long cycles through four prescribed vertices of a polyhedral graph. (English)
Discuss. Math., Graph Theory 28, No. 3, 441-451 (2008).
19
The independence number in graphs of maximum degree three. (English)
Discrete Math. 308, No. 23, 5829-5833 (2008).
20
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 74 total