Result 81 to 100 from 128 total
Almost all graphs with high girth and suitable density have high chromatic number. (English)
J. Graph Theory 37, No.4, 220-226 (2001).
81
A well-rounded linear function. (English)
Electron. J. Comb. 8, No.2, Research Paper R6, 13 p. (2001).
82
On the chromatic number of graphs. (English)
J. Optimization Theory Appl. 109, No.1, 51-67 (2001).
83
Unextendible product bases. (English)
J. Comb. Theory, Ser. A 95, No.1, 169-179 (2001).
84
Oriented list colorings of graphs. (English)
J. Graph Theory 36, No.4, 217-229 (2001).
85
A technology for reverse-engineering a combinatorial problem from a rational generating function. (English)
Adv. Appl. Math. 26, No.2, 129-153 (2001).
86
A bijection for some paths on the slit plane. (English)
Adv. Appl. Math. 26, No.2, 89-96 (2001).
87
Gaps in the chromatic spectrum of face-constrained plane graphs. (English)
Electron. J. Comb. 8, No.1, Research paper N3, 4 p. (2001).
88
25 pretty graph colouring problems. (English)
Discrete Math. 229, No.1-3, 167-169 (2001).
89
Area of Catalan paths. (English)
Discrete Math. 226, No.1-3, 439-444 (2001).
90
Rotary hypermaps of genus 2. (English)
Beitr. Algebra Geom. 42, No.1, 39-58 (2001).
91
Platonic hypermaps. (English)
Beitr. Algebra Geom. 42, No.1, 1-37 (2001).
92
Using the Entringer numbers to count the alternating permutations according a new parameter. (English)
Ann. I.S.U.P. 44, No.2-3, 73-86 (2000).
93
On the total chromatic number of Steiner systems. (English)
J. Comb. Math. Comb. Comput. 35, 51-64 (2000).
94
Counting rooted near-triangulations on the cylinder. (English)
J. Math. Res. Expo. 20, No.4, 529-533 (2000).
95
Enumeration of labeled Euler graphs with cut vertices. (English)
J. Math., Wuhan Univ. 20, No.4, 473-478 (2000).
96
Coloring edges of embedded graphs. (English)
J. Graph Theory 35, No.3, 197-205 (2000).
97
A transfer matrix approach to the enumeration of plane meanders. (English)
J. Phys. A, Math. Gen. 33, No.34, 5953-5963 (2000).
98
On the number of large $h$-hypergraphs with a fixed diameter. (English)
Discrete Math. 223, No.1-3, 287-297 (2000).
99
The enumeration of self-complementary $k$-multigraphs. (English)
Acta Math. Appl. Sin., Engl. Ser. 16, No.3, 332-336 (2000).
100
Result 81 to 100 from 128 total
Start
Contact
Print
General Help
