Result 1 to 18 of 18 total
Maximal outerplanar graphs as chordal graphs path-neighborhood graphs, and triangle graphs. (English)
Australas. J. Comb. 52, 185-195 (2012).
1
An axiomatization of the median procedure on the $n$-cube. (English)
Discrete Appl. Math. 159, No. 9, 939-944 (2011).
2
Edge closures of Hamiltonian type. (English)
Congr. Numerantium 198, 3-14 (2009).
3
On irreducible no-hole $L$(2,1)-coloring of trees. (English)
Networks 53, No. 2, 206-211 (2009).
4
Norm statistics and the complexity of clustering problems. (English)
Discrete Appl. Math. 157, No. 8, 1831-1839 (2009).
5
Turán theorems and convexity invariants for directed graphs. (English)
Discrete Math. 308, No. 20, 4544-4550 (2008).
6
Fault tolerance of Cayley graphs. (English)
Ann. Comb. 11, No. 2, 161-171 (2007).
7
Vertex orderings of graphs: an overview. (English)
Congr. Numerantium 182, 207-219 (2006).
8
On a contraction-expansion closure in graphs (English)
RelMiCS, 113-119 (2000).
9
From Hall’s matching theorem to optimal routing on hypercubes. (English)
J. Comb. Theory, Ser. B 74, No.2, 291-301 (1998).
10
From Hall’s matching theorem to optimal routing on hypercubes (English)
J. Comb. Theory, Ser. B 74, No. 2, 291-301 (1998).
11
Binary codes of structures dual to unitals. (English)
Congr. Numerantium 123, 119-124 (1997).
12
Disjoint paths in hypercubes. (English)
Congr. Numerantium 119, 105-112 (1996).
13
On ideal clutters, metrics and multiflows (English)
IPCO, 275-287 (1996).
14
On combinatorial properties of binary spaces (English)
IPCO, 212-227 (1995).
15
Ideal 0, 1 matrices. (English)
J. Comb. Theory, Ser. B 60, No.1, 145-157 (1994).
16
Ideal 0, 1 matrices (English)
J. Comb. Theory, Ser. B 60, No. 1, 145-157 (1994).
17
The 2-quasi-greedy algorithm for cardinality constrained matroid bases. (English)
Discrete Appl. Math. 13, 277-286 (1986).
18
Result 1 to 18 of 18 total
Start
Contact
Print
General Help
