Result 1 to 20 from 107 total
Degree sequences and the existence of $k$-factors. (English)
Graphs Comb. 28, No. 2, 149-166 (2012).
1
Binding number, minimum degree, and cycle structure in graphs. (English)
J. Graph Theory 71, No. 2, 219-228 (2012).
2
Best monotone degree conditions for binding number. (English)
Discrete Math. 311, No. 18-19, 2037-2043 (2011).
3
Sufficient degree conditions for $k$-edge-connectedness of a graph. (English)
Networks 54, No. 2, 95-98 (2009).
4
Long cycles in 2-connected triangle-free graphs. (English)
Ars Comb. 86, 295-304 (2008).
5
Best monotone degree bounds for various graph parameters. (English)
Congr. Numerantium 192, 75-83 (2008).
6
Subdivision of edges and matching size. (English)
Ars Comb. 84, 141-153 (2007).
7
Tutte sets in graphs. I: Maximal Tutte sets and $D$-graphs. (English)
J. Graph Theory 55, No. 4, 343-358 (2007).
8
Tutte sets in graphs. II: The complexity of finding maximum Tutte sets. (English)
Discrete Appl. Math. 155, No. 10, 1336-1343 (2007).
9
Tutte sets in graphs I: Maximal tutte sets and D-graphs (English)
Journal of Graph Theory 55, No. 4, 343-358 (2007).
10
Toughness in graphs ‒ a survey. (English)
Graphs Comb. 22, No. 1, 1-35 (2006).
11
Toughness in graphs - A survey (English)
Graphs and Combinatorics 22, No. 1, 1-35 (2006).
12
Improved bounds for the chromatic number of a graph. (English)
J. Graph Theory 47, No. 3, 217-225 (2004).
13
Toughness, minimum degree, and spanning cubic subgraphs. (English)
J. Graph Theory 45, No. 2, 119-141 (2004); corrected version ibid. 46, No. 2, 119 ff (2004).
14
Improved bounds for the chromatic number of a graph (English)
Journal of Graph Theory 47, No. 3, 217-225 (2004).
15
Toughness, minimum degree, and spanning cubic subgraphs (English)
Journal of Graph Theory 45, No. 2, 119-141 (2004).
16
Toughness, minimum degree, and spanning cubic subgraphs (English)
Journal of Graph Theory 46, No. 2, 144 (2004).
17
Bounds for the chromatic number of graphs with partial information. (English)
Discrete Math. 263, No.1-3, 47-59 (2003).
18
Orienting graphs to optimize reachability. (English)
Comput. Res. Repos. 2002, Article No. 0205042 (2002).
19
The harmonious chromatic number of deep and wide complete $n$-ary trees. (English)
Alavi, Yousef (ed.) et al., Papers of the 9th quadrennial international conference on graph theory, combinatorics, algorithms, and applications, Kalamazoo, MI, USA, June 4‒9, 2000. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 11, 491-502 (2002).
20
Result 1 to 20 from 107 total
Start
Contact
Print
General Help
