Result 1 to 20 of 60 total
Some notes on extremal discriminant analysis. (English)
J. Multivariate Anal. 103, No. 1, 107-115 (2012).
1
Some notes on extremal discriminant analysis (English)
J. Multivariate Analysis 103, No. 1, 107-115 (2012).
2
Cycles in $k$-traceable oriented graphs. (English)
Discrete Math. 311, No. 18-19, 2085-2094 (2011).
3
Connectivity of claw-free maximal nontraceable graphs. (English)
Util. Math. 84, 245-255 (2011).
4
The order of hypotraceable oriented graphs. (English)
Discrete Math. 311, No. 14, 1273-1280 (2011).
5
Hamiltonicity of $k$-traceable graphs. (English)
Electron. J. Comb. 18, No. 1, Research Paper P63, 13 p., electronic only (2011).
6
Significant differences between path partitions in directed and undirected graphs. (English)
Util. Math. 83, 179-185 (2010).
7
Traceability of $k$-traceable oriented graphs. (English)
Discrete Math. 310, No. 8, 1325-1333 (2010).
8
Limiting distributions of maxima under triangular schemes (English)
J. Multivariate Analysis 101, No. 10, 2346-2357 (2010).
9
Detour saturated oriented graphs. (English)
Util. Math. 79, 167-180 (2009).
10
Expansions of multivariate Pickands densities and testing the tail dependence (English)
J. Multivariate Analysis 100, No. 6, 1168-1181 (2009).
11
Progress on the traceability conjecture for oriented graphs. (English)
Discrete Math. Theor. Comput. Sci. 10, No. 3, 105-114, electronic only (2008).
12
A traceability conjecture for oriented graphs. (English)
Electron. J. Comb. 15, No. 1, Research Paper R150, 13 p. (2008).
13
Maximal nontraceable graphs with toughness less than one. (English)
Electron. J. Comb. 15, No. 1, Research Paper R18, 19 p. (2008).
14
Critical graphs with respect to vertex identification. (English)
Util. Math. 76, 213-227 (2008).
15
Progress on the traceability conjecture for oriented graphs (English)
Discrete Mathematics & Theoretical Computer Science 10, No. 3 (2008).
16
Translucent states: political mediation of E-transparency (English)
IJEGR 4, No. 3, 81-102 (2008).
17
The path partition conjecture is true for claw-free graphs. (English)
Discrete Math. 307, No. 11-12, 1285-1290 (2007).
18
Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs. (English)
Discrete Math. 307, No. 11-12, 1266-1275 (2007).
19
Cubic maximal nontraceable graphs. (English)
Discrete Math. 307, No. 7-8, 885-891 (2007).
20
Result 1 to 20 of 60 total
Start
Contact
Print
General Help
