Result 1 to 20 of 51 total
On the spectrum of 3-coloured digraphs. (English)
Linear Multilinear Algebra 60, No. 6, 743-756 (2012).
1
Explaining variational approximations. (English)
Am. Stat. 64, No. 2, 140-153 (2010).
2
Mixed volume techniques for embeddings of Laman graphs. (English)
Comput. Geom. 43, No. 2, 84-93 (2010).
3
A note on edge-colourings avoiding rainbow $K_{4}$ and monochromatic $K_{m}$. (English)
Electron. J. Comb. 16, No. 1, Research Paper N19, 9 p. (2009).
4
Mixed graph edge coloring. (English)
Discrete Math. 309, No. 12, 4027-4036 (2009).
5
Disjoint directed and undirected paths and cycles in digraphs. (English)
Theor. Comput. Sci. 410, No. 47-49, 5138-5144 (2009).
6
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. (English)
Discrete Appl. Math. 157, No. 2, 272-279 (2009).
7
Super edge-connectivity of mixed Cayley graph. (English)
Discrete Math. 309, No. 1, 264-270 (2009).
8
Lower bounds for the colored mixed chromatic number of some classes of graphs. (English)
Commentat. Math. Univ. Carol. 49, No. 4, 637-645 (2008).
9
Moore bound for mixed networks. (English)
Discrete Math. 308, No. 23, 5499-5503 (2008).
10
On edge singularity and eigenvectors of mixed graphs. (English)
Acta Math. Sin., Engl. Ser. 24, No. 1, 139-146 (2008).
11
Tournament scoring problem. (English)
Appl. Math. Comput. 199, No. 1, 211-222 (2008).
12
On eigenvectors of mixed graphs with exactly one nonsingular cycle. (English)
Czech. Math. J. 57, No. 4, 1215-1222 (2007).
13
Adding local constraints to Bayesian networks. (English)
Kobti, Ziad (ed.) et al., Advances in artificial intelligence. 20th conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2007, Montreal, Canada, May 28‒30, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72664-7/pbk). Lecture Notes in Computer Science 4509. Lecture Notes in Artificial Intelligence, 344-355 (2007).
14
Mixed covering arrays on graphs. (English)
Martínez Moro, Edgar (ed.), V jornadas de matemática discreta y algorítmica. Valladolid: Universidade de Valladolid, Secretariado de Publicaciones e Intercambio Editorial (ISBN 978-84-8448-380-9/pbk). Ciencias (Valladolid) 23, 375-379 (2006).
15
Covering partially directed graphs with directed paths. (English)
Discrete Math. 306, No. 13, 1390-1404 (2006).
16
Largest eigenvalue of a unicyclic mixed graphs. (English)
Appl. Math., Ser. B (Engl. Ed.) 19, No. 2, 140-148 (2004).
17
Asymptotic size Ramsey results for bipartite graphs. (English)
SIAM J. Discrete Math. 16, No.1, 99-113 (2003).
18
On the circuit cover problem for mixed graphs. (English)
Comb. Probab. Comput. 11, No.1, 43-59 (2002).
19
A note on orientations of mixed graphs. (English)
Discrete Appl. Math. 116, No.3, 271-278 (2002).
20
Result 1 to 20 of 51 total
Start
Contact
Print
General Help
