|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
35 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A characterization of cycle-free unit probe interval graphs |
Brown, David E. |
2009 |
157 | 4 |
p. 762-767 6 p. |
article |
|
| 2 | A note on the lower bound of centralized radio broadcasting for planar reachability graphs |
Galčík, F. |
2009 |
157 | 4 |
p. 853-857 5 p. |
article |
|
| 3 | Approximation algorithms for the weighted independent set problem in sparse graphs |
Kako, Akihisa |
2009 |
157 | 4 |
p. 617-626 10 p. |
article |
|
| 4 | Bernoulli polynomials and Pascal matrices in the context of Clifford analysis |
Malonek, H.R. |
2009 |
157 | 4 |
p. 838-847 10 p. |
article |
|
| 5 | Bipartite density of triangle-free subcubic graphs |
Zhu, Xuding |
2009 |
157 | 4 |
p. 710-714 5 p. |
article |
|
| 6 | Contents |
2009 |
157 | 4 |
p. vii-viii nvt p. |
article |
||
| 7 | Editorial Board |
2009 |
157 | 4 |
p. v-vi nvt p. |
article |
||
| 8 | Equitable total coloring of C m □ C n |
Tong, Chunling |
2009 |
157 | 4 |
p. 596-601 6 p. |
article |
|
| 9 | Eulerian detachments with local edge-connectivity |
Fukunaga, Takuro |
2009 |
157 | 4 |
p. 691-698 8 p. |
article |
|
| 10 | Extended cooperative networks games |
Quilliot, Alain |
2009 |
157 | 4 |
p. 728-737 10 p. |
article |
|
| 11 | Fibonacci numbers and Lucas numbers in graphs |
Startek, Mariusz |
2009 |
157 | 4 |
p. 864-868 5 p. |
article |
|
| 12 | Four new sums of graphs and their Wiener indices |
Eliasi, Mehdi |
2009 |
157 | 4 |
p. 794-803 10 p. |
article |
|
| 13 | Graph operations characterizing rank-width |
Courcelle, Bruno |
2009 |
157 | 4 |
p. 627-640 14 p. |
article |
|
| 14 | Groups with the same non-commuting graph |
Darafsheh, M.R. |
2009 |
157 | 4 |
p. 833-837 5 p. |
article |
|
| 15 | Homogeneous and strictly homogeneous criteria for partial structures |
Romov, Boris A. |
2009 |
157 | 4 |
p. 699-709 11 p. |
article |
|
| 16 | Improvements on the Johnson bound for Reed–Solomon codes |
Muralidhara, V.N. |
2009 |
157 | 4 |
p. 812-818 7 p. |
article |
|
| 17 | Injective coloring of planar graphs |
Bu, Yuehua |
2009 |
157 | 4 |
p. 663-672 10 p. |
article |
|
| 18 | List-coloring graphs without K 4 , k -minors |
Kawarabayashi, Ken-ichi |
2009 |
157 | 4 |
p. 659-662 4 p. |
article |
|
| 19 | MILP approach to pattern generation in logical analysis of data |
Ryoo, Hong Seo |
2009 |
157 | 4 |
p. 749-761 13 p. |
article |
|
| 20 | Minimally 3-restricted edge connected graphs |
Liu, Qinghai |
2009 |
157 | 4 |
p. 685-690 6 p. |
article |
|
| 21 | On a parallel machine scheduling problem with equal processing times |
Kravchenko, Svetlana A. |
2009 |
157 | 4 |
p. 848-852 5 p. |
article |
|
| 22 | On bipartite graphs with minimal energy |
Li, Xueliang |
2009 |
157 | 4 |
p. 869-873 5 p. |
article |
|
| 23 | On pseudo 2-factors |
Bekkai, Siham |
2009 |
157 | 4 |
p. 774-779 6 p. |
article |
|
| 24 | On the complexity of constructing Golomb Rulers |
Meyer, Christophe |
2009 |
157 | 4 |
p. 738-748 11 p. |
article |
|
| 25 | Paintshop, odd cycles and necklace splitting |
Meunier, Frédéric |
2009 |
157 | 4 |
p. 780-793 14 p. |
article |
|
| 26 | Restricted k -ary words and functional equations |
Firro, Ghassan |
2009 |
157 | 4 |
p. 602-616 15 p. |
article |
|
| 27 | Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation |
Tazari, Siamak |
2009 |
157 | 4 |
p. 673-684 12 p. |
article |
|
| 28 | Structure and dimension of the eigenspace of a concave Monge matrix |
Gavalec, Martin |
2009 |
157 | 4 |
p. 768-773 6 p. |
article |
|
| 29 | Super-connected arc-transitive digraphs |
Meng, Jixiang |
2009 |
157 | 4 |
p. 653-658 6 p. |
article |
|
| 30 | The first and second Zagreb indices of some graph operations |
Khalifeh, M.H. |
2009 |
157 | 4 |
p. 804-811 8 p. |
article |
|
| 31 | The NLC-width and clique-width for powers of graphs of bounded tree-width |
Gurski, Frank |
2009 |
157 | 4 |
p. 583-595 13 p. |
article |
|
| 32 | The parameterized complexity of the induced matching problem |
Moser, Hannes |
2009 |
157 | 4 |
p. 715-727 13 p. |
article |
|
| 33 | Upper bounds of degree 3 for the probability of the union of events via linear programming |
Veneziani, Pierangela |
2009 |
157 | 4 |
p. 858-863 6 p. |
article |
|
| 34 | Weighted coloring on planar, bipartite and split graphs: Complexity and approximation |
de Werra, D. |
2009 |
157 | 4 |
p. 819-832 14 p. |
article |
|
| 35 | Weighted distances based on neighborhood sequences for point-lattices |
Strand, Robin |
2009 |
157 | 4 |
p. 641-652 12 p. |
article |
35 results found