|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
21 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A combinatorial proof of the cyclic sieving phenomenon for faces of Coxeterhedra |
Eu, Sen-Peng |
2012 |
25 | 4 |
p. 617-638 |
article |
|
| 2 | Acyclic edge coloring of planar graphs without 4-cycles |
Wang, Weifan |
2012 |
25 | 4 |
p. 562-586 |
article |
|
| 3 | A note on optimal pebbling of hypercubes |
Fu, Hung-Lin |
2012 |
25 | 4 |
p. 597-601 |
article |
|
| 4 | Chromatic number of distance graphs generated by the sets {2,3,x,y} |
Liu, Daphne Der-Fen |
2012 |
25 | 4 |
p. 680-693 |
article |
|
| 5 | Colorability of mixed hypergraphs and their chromatic inversions |
Hegyháti, Máté |
2012 |
25 | 4 |
p. 737-751 |
article |
|
| 6 | Distance two edge labelings of lattices |
Lin, Wensong |
2012 |
25 | 4 |
p. 661-679 |
article |
|
| 7 | Enumerating the edge-colourings and total colourings of a regular graph |
Bessy, S. |
2012 |
25 | 4 |
p. 523-535 |
article |
|
| 8 | Equivalence of two conjectures on equitable coloring of graphs |
Chen, Bor-Liang |
2011 |
25 | 4 |
p. 501-504 |
article |
|
| 9 | L(p,q)-labeling of sparse graphs |
Charpentier, Clément |
2012 |
25 | 4 |
p. 646-660 |
article |
|
| 10 | On total weight choosability of graphs |
Pan, Haili |
2012 |
25 | 4 |
p. 766-783 |
article |
|
| 11 | (p,q)-total labeling of complete graphs |
Chia, Ma-Lian |
2012 |
25 | 4 |
p. 543-561 |
article |
|
| 12 | Preface: optimization in graphs |
Guan, D. J. |
2013 |
25 | 4 |
p. 499-500 |
article |
|
| 13 | Some results on the target set selection problem |
Chiang, Chun-Ying |
2012 |
25 | 4 |
p. 702-715 |
article |
|
| 14 | Structure of Fibonacci cubes: a survey |
Klavžar, Sandi |
2011 |
25 | 4 |
p. 505-522 |
article |
|
| 15 | The broadcast median problem in heterogeneous postal model |
Tsou, Cheng-Hsiao |
2012 |
25 | 4 |
p. 602-616 |
article |
|
| 16 | The decycling number of outerplanar graphs |
Chang, Huilan |
2012 |
25 | 4 |
p. 536-542 |
article |
|
| 17 | The game Grundy number of graphs |
Havet, Frédéric |
2012 |
25 | 4 |
p. 752-765 |
article |
|
| 18 | The hamiltonian numbers in digraphs |
Chang, Ting-Pang |
2012 |
25 | 4 |
p. 694-701 |
article |
|
| 19 | The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups |
Li, Xiangwen |
2012 |
25 | 4 |
p. 716-736 |
article |
|
| 20 | The partition method for poset-free families |
Griggs, Jerrold R. |
2012 |
25 | 4 |
p. 587-596 |
article |
|
| 21 | Three conjectures on the signed cycle domination in graphs |
Guan, Jian |
2012 |
25 | 4 |
p. 639-645 |
article |
21 results found