Result 1 to 20 of 39 total
Balancing covectors. (English)
SIAM J. Discrete Math. 25, No. 3, 1315-1318 (2011).
1
Cayley sum graphs and eigenvalues of $(3,6)$-fullerenes. (English)
J. Comb. Theory, Ser. B 99, No. 2, 358-369 (2009).
2
Cayley sum graphs and eigenvalues of (3, 6)-fullerenes (English)
J. Comb. Theory, Ser. B 99, No. 2, 358-369 (2009).
3
Silver cubes. (English)
Graphs Comb. 24, No. 5, 429-442 (2008).
4
Silver cubes (English)
Graphs and Combinatorics 24, No. 5, 429-442 (2008).
5
Circular coloring the plane. (English)
SIAM J. Discrete Math. 21, No. 2, 461-465 (2007).
6
Triangular embeddings of complete graphs from graceful labellings of paths. (English)
J. Comb. Theory, Ser. B 97, No. 6, 964-970 (2007).
7
Eulerian and bipartite orientable matroids. (English)
Grimmett, Geoffrey (ed.) et al., Combinatorics, complexity, and chance. A tribute to Dominic Welsh. Oxford: Oxford University Press (ISBN 0-19-857127-5/hbk). Oxford Lecture Series in Mathematics and its Applications 34, 11-27 (2007).
8
Triangular embeddings of complete graphs from graceful labellings of paths (English)
J. Comb. Theory, Ser. B 97, No. 6, 964-970 (2007).
9
Packing non-zero $A$-paths in group-labelled graphs. (English)
Combinatorica 26, No. 5, 521-532 (2006).
10
Balanced signings and the chromatic number of oriented matroids (English)
Combinatorics, Probability & Computing 15, No. 4, 523-539 (2006).
11
An optimization problem related to VoD broadcasting. (English)
Deng, Xiaotie (ed.) et al., Algorithms and computation. 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19‒21, 2005. Proceedings. Berlin: Springer (ISBN 3-540-30935-7/pbk). Lecture Notes in Computer Science 3827, 116-125 (2005).
12
Edge disjoint cycles through specified vertices. (English)
J. Graph Theory 50, No. 3, 246-260 (2005).
13
Coloring-flow duality of embedded graphs. (English)
Trans. Am. Math. Soc. 357, No. 10, 3993-4016 (2005).
14
Edge disjoint cycles through specified vertices (English)
Journal of Graph Theory 50, No. 3, 246-260 (2005).
15
An optimization problem related to vod broadcasting (English)
ISAAC, 116-125 (2005).
16
Binary Gray codes with long bit runs. (English)
Electron. J. Comb. 10, Research paper R27, 10 p. (2003); printed version J. Comb. 10, No. 3 (2003).
17
Binary gray codes with long bit runs (English)
Electr. J. Comb. 10 (2003).
18
The circular flow number of a 6-edge connected graph is less than four. (English)
Combinatorica 22, No.3, 455-459 (2002).
19
High-girth graphs avoiding a minor are nearly bipartite. (English)
J. Comb. Theory, Ser. B 83, No.1, 1-14 (2001).
20
Result 1 to 20 of 39 total
Start
Contact
Print
General Help
