|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
90 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A complete characterization of paths that are m -step competition graphs |
Belmont, Eva |
2011 |
81-90 | 14 |
p. 1381-1390 10 p. |
article |
|
| 2 | A distance approximating trees |
Bálint, Vojtech |
2008 |
81-90 | 14 |
p. 2740-2752 13 p. |
article |
|
| 3 | A generalization of Fibonacci and Lucas matrices |
Stanimirović, Predrag |
2008 |
81-90 | 14 |
p. 2606-2619 14 p. |
article |
|
| 4 | Algorithmic and explicit determination of the Lovász number for certain circulant graphs |
Brimkov, Valentin |
2007 |
81-90 | 14 |
p. 1812-1825 14 p. |
article |
|
| 5 | Algorithms for solving multiobjective discrete control problems and dynamic c-games on networks |
Lozovanu, Dmitrii |
2007 |
81-90 | 14 |
p. 1846-1857 12 p. |
article |
|
| 6 | An algorithm for constructing magic squares |
Kim, Yangkok |
2008 |
81-90 | 14 |
p. 2804-2809 6 p. |
article |
|
| 7 | An application of the Turán theorem to domination in graphs |
Shan, Erfang |
2008 |
81-90 | 14 |
p. 2712-2718 7 p. |
article |
|
| 8 | An efficient condition for a graph to be Hamiltonian |
Li, Shengjia |
2007 |
81-90 | 14 |
p. 1842-1845 4 p. |
article |
|
| 9 | An enumeration of equilateral triangle dissections |
Drápal, Aleš |
2010 |
81-90 | 14 |
p. 1479-1495 17 p. |
article |
|
| 10 | A new Euler–Mahonian constructive bijection |
Vajnovszki, Vincent |
2011 |
81-90 | 14 |
p. 1453-1459 7 p. |
article |
|
| 11 | A new family of proximity graphs: Class cover catch digraphs |
DeVinney, Jason |
2006 |
81-90 | 14 |
p. 1975-1982 8 p. |
article |
|
| 12 | A note on the signed edge domination number in graphs |
Fu, Xueliang |
2008 |
81-90 | 14 |
p. 2790-2792 3 p. |
article |
|
| 13 | A note on total reinforcement in graphs |
Henning, Michael A. |
2011 |
81-90 | 14 |
p. 1443-1446 4 p. |
article |
|
| 14 | Approximating the minimum clique cover and other hard problems in subtree filament graphs |
Keil, J. Mark |
2006 |
81-90 | 14 |
p. 1983-1995 13 p. |
article |
|
| 15 | A tight bound on the min-ratio edge-partitioning problem of a tree |
Chu, An-Chiang |
2010 |
81-90 | 14 |
p. 1471-1478 8 p. |
article |
|
| 16 | Balanced and 1-balanced graph constructions |
Hobbs, Arthur M. |
2010 |
81-90 | 14 |
p. 1511-1523 13 p. |
article |
|
| 17 | Biprobabilistic values for bicooperative games |
Bilbao, J.M. |
2008 |
81-90 | 14 |
p. 2698-2711 14 p. |
article |
|
| 18 | Bounds on the connected k -domination number in graphs |
Hansberg, Adriana |
2010 |
81-90 | 14 |
p. 1506-1510 5 p. |
article |
|
| 19 | Bounds relating the weakly connected domination number to the total domination number and the matching number |
Hattingh, Johannes H. |
2009 |
81-90 | 14 |
p. 3086-3093 8 p. |
article |
|
| 20 | Constrained versions of Sauer’s lemma |
Ratsaby, Joel |
2008 |
81-90 | 14 |
p. 2753-2767 15 p. |
article |
|
| 21 | Constructions of optimal GDRP ( n , λ ; v ) ’s of type λ 1 μ m − 1 |
Yan, Jie |
2008 |
81-90 | 14 |
p. 2666-2678 13 p. |
article |
|
| 22 | Contents |
2009 |
81-90 | 14 |
p. vii-viii nvt p. |
article |
||
| 23 | Contents |
2010 |
81-90 | 14 |
p. v- 1 p. |
article |
||
| 24 | Contents |
2006 |
81-90 | 14 |
p. vii- 1 p. |
article |
||
| 25 | Contents |
2008 |
81-90 | 14 |
p. vii-viii nvt p. |
article |
||
| 26 | Contents |
2007 |
81-90 | 14 |
p. v- 1 p. |
article |
||
| 27 | Contents |
2011 |
81-90 | 14 |
p. v- 1 p. |
article |
||
| 28 | Decomposing complete edge-chromatic graphs and hypergraphs. Revisited |
Gurvich, Vladimir |
2009 |
81-90 | 14 |
p. 3069-3085 17 p. |
article |
|
| 29 | Degree sequences and graphs with disjoint spanning trees |
Lai, Hong-Jian |
2011 |
81-90 | 14 |
p. 1447-1452 6 p. |
article |
|
| 30 | 2-dimensional optical orthogonal codes from singer groups |
Alderson, T.L. |
2009 |
81-90 | 14 |
p. 3008-3019 12 p. |
article |
|
| 31 | DNA recombination through assembly graphs |
Angeleska, Angela |
2009 |
81-90 | 14 |
p. 3020-3037 18 p. |
article |
|
| 32 | Each maximal planar graph with exactly two separating triangles is Hamiltonian |
Helden, Guido |
2007 |
81-90 | 14 |
p. 1833-1836 4 p. |
article |
|
| 33 | Edge intersection graphs of systems of paths on a grid with a bounded number of bends |
Asinowski, Andrei |
2009 |
81-90 | 14 |
p. 3174-3180 7 p. |
article |
|
| 34 | Editorial Board |
2009 |
81-90 | 14 |
p. v-vi nvt p. |
article |
||
| 35 | Editorial Board |
2006 |
81-90 | 14 |
p. v-vi nvt p. |
article |
||
| 36 | Editorial Board |
2008 |
81-90 | 14 |
p. v-vi nvt p. |
article |
||
| 37 | Enumeration of matchings in families of self-similar graphs |
Teufl, Elmar |
2010 |
81-90 | 14 |
p. 1524-1535 12 p. |
article |
|
| 38 | Error-correcting pooling designs associated with some distance-regular graphs |
Bai, Yujuan |
2009 |
81-90 | 14 |
p. 3038-3045 8 p. |
article |
|
| 39 | Existence of directed triplewhist tournaments with the three person property 3 P D T W h ( v ) |
Abel, R.J.R. |
2008 |
81-90 | 14 |
p. 2655-2665 11 p. |
article |
|
| 40 | Existence of directedwhist tournaments with the three person property 3 PDWh ( v ) |
Bennett, F.E. |
2006 |
81-90 | 14 |
p. 1939-1946 8 p. |
article |
|
| 41 | Extremal fullerene graphs with the maximum Clar number |
Ye, Dong |
2009 |
81-90 | 14 |
p. 3152-3173 22 p. |
article |
|
| 42 | Facets of the ( s , t ) - p -path polytope |
Stephan, Rüdiger |
2009 |
81-90 | 14 |
p. 3119-3132 14 p. |
article |
|
| 43 | Further results on atom-bond connectivity index of trees |
Xing, Rundan |
2010 |
81-90 | 14 |
p. 1536-1545 10 p. |
article |
|
| 44 | G -graphs: An efficient tool for constructing symmetric and semisymmetric graphs |
Bretto, Alain |
2008 |
81-90 | 14 |
p. 2719-2739 21 p. |
article |
|
| 45 | Guest Editors Listing for 3rd Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2004) Guest Edited by Ulrich Faigle, Leo Liberti, Francesco Maffioli, and Stefan Pickl |
2007 |
81-90 | 14 |
p. 1794- 1 p. |
article |
||
| 46 | Guide for authors |
2006 |
81-90 | 14 |
p. I-IV nvt p. |
article |
||
| 47 | Hamiltonian cycles passing through linear forests in k -ary n -cubes |
Wang, Shiying |
2011 |
81-90 | 14 |
p. 1425-1435 11 p. |
article |
|
| 48 | Hard coloring problems in low degree planar bipartite graphs |
Chlebík, Miroslav |
2006 |
81-90 | 14 |
p. 1960-1965 6 p. |
article |
|
| 49 | Identities via Bell matrix and Fibonacci matrix |
Wang, Weiping |
2008 |
81-90 | 14 |
p. 2793-2803 11 p. |
article |
|
| 50 | Inequalities of Nordhaus–Gaddum type for doubly connected domination number |
Akhbari, M.H. |
2010 |
81-90 | 14 |
p. 1465-1470 6 p. |
article |
|
| 51 | Memory management optimization problems for integrated circuit simulators |
Bossart, Timothée |
2007 |
81-90 | 14 |
p. 1795-1811 17 p. |
article |
|
| 52 | Metric and ultrametric spaces of resistances |
Gurvich, Vladimir |
2010 |
81-90 | 14 |
p. 1496-1505 10 p. |
article |
|
| 53 | Minimal average cost of searching for a counterfeit coin: Restricted model |
Liu, Wen An |
2006 |
81-90 | 14 |
p. 1996-2009 14 p. |
article |
|
| 54 | Minimum cost open chain reconfiguration |
Nourollah, Ali |
2011 |
81-90 | 14 |
p. 1418-1424 7 p. |
article |
|
| 55 | New formulations for the Kissing Number Problem |
Kucherenko, Sergei |
2007 |
81-90 | 14 |
p. 1837-1841 5 p. |
article |
|
| 56 | None of the coronoid systems can be isometrically embedded into a hypercube |
Zhang, Heping |
2008 |
81-90 | 14 |
p. 2817-2822 6 p. |
article |
|
| 57 | [No title] |
2007 |
81-90 | 14 |
p. 1793- 1 p. |
article |
||
| 58 | On graphs determining links with maximal number of components via medial construction |
Jin, Xian’an |
2009 |
81-90 | 14 |
p. 3099-3110 12 p. |
article |
|
| 59 | On graphs on n vertices having an identifying code of cardinality ⌈ log 2 ( n + 1 ) ⌉ |
Moncel, Julien |
2006 |
81-90 | 14 |
p. 2032-2039 8 p. |
article |
|
| 60 | On powers of graphs of bounded NLC-width (clique-width) |
Suchan, Karol |
2007 |
81-90 | 14 |
p. 1885-1893 9 p. |
article |
|
| 61 | On the generation of bicliques of a graph |
Dias, Vânia M.F. |
2007 |
81-90 | 14 |
p. 1826-1832 7 p. |
article |
|
| 62 | On the linear ( n − 1 ) -arboricity of K n ( m ) |
Xue, Bing |
2010 |
81-90 | 14 |
p. 1546-1550 5 p. |
article |
|
| 63 | On the list dynamic coloring of graphs |
Akbari, S. |
2009 |
81-90 | 14 |
p. 3005-3007 3 p. |
article |
|
| 64 | On the minimal energy ordering of trees with perfect matchings |
Guo, Ji-Ming |
2008 |
81-90 | 14 |
p. 2598-2605 8 p. |
article |
|
| 65 | On the parallel computation of the biconnected and strongly connected co-components of graphs |
Nikolopoulos, Stavros D. |
2007 |
81-90 | 14 |
p. 1858-1877 20 p. |
article |
|
| 66 | On the restricted homomorphism problem |
Brewster, Richard C. |
2008 |
81-90 | 14 |
p. 2823-2826 4 p. |
article |
|
| 67 | Optimal key systems |
Crona, Kristina |
2006 |
81-90 | 14 |
p. 1966-1974 9 p. |
article |
|
| 68 | Optimal popular matchings |
Kavitha, Telikepalli |
2009 |
81-90 | 14 |
p. 3181-3186 6 p. |
article |
|
| 69 | Orthogonal double covers of Cayley graphs |
Scapellato, R. |
2009 |
81-90 | 14 |
p. 3111-3118 8 p. |
article |
|
| 70 | Path–kipas Ramsey numbers |
Salman, A.N.M. |
2007 |
81-90 | 14 |
p. 1878-1884 7 p. |
article |
|
| 71 | Patterns of simple gene assembly in ciliates |
Harju, Tero |
2008 |
81-90 | 14 |
p. 2581-2597 17 p. |
article |
|
| 72 | Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution |
Yaman, Hande |
2009 |
81-90 | 14 |
p. 3133-3151 19 p. |
article |
|
| 73 | Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations |
Chapman, S.T. |
2006 |
81-90 | 14 |
p. 1947-1959 13 p. |
article |
|
| 74 | Properly colored paths and cycles |
Fujita, Shinya |
2011 |
81-90 | 14 |
p. 1391-1397 7 p. |
article |
|
| 75 | Random-order bin packing |
Coffman Jr., Edward G. |
2008 |
81-90 | 14 |
p. 2810-2816 7 p. |
article |
|
| 76 | Reciprocal complementary Wiener numbers of trees, unicyclic graphs and bicyclic graphs |
Cai, Xiaochun |
2009 |
81-90 | 14 |
p. 3046-3054 9 p. |
article |
|
| 77 | Recursive merge sort with erroneous comparisons |
Hadjicostas, Petros |
2011 |
81-90 | 14 |
p. 1398-1417 20 p. |
article |
|
| 78 | 2-resonance of plane bipartite graphs and its applications to boron–nitrogen fullerenes |
Zhang, Heping |
2010 |
81-90 | 14 |
p. 1559-1569 11 p. |
article |
|
| 79 | Searching for a counterfeit coin with b-balance |
Liu, Wen An |
2006 |
81-90 | 14 |
p. 2010-2023 14 p. |
article |
|
| 80 | Solving some NP-complete problems using split decomposition |
Rao, Michaël |
2008 |
81-90 | 14 |
p. 2768-2780 13 p. |
article |
|
| 81 | Some identities on the Catalan, Motzkin and Schröder numbers |
Deng, Eva Y.P. |
2008 |
81-90 | 14 |
p. 2781-2789 9 p. |
article |
|
| 82 | Some results on the ordering of the Laplacian spectral radii of unicyclic graphs |
Liu, Ying |
2008 |
81-90 | 14 |
p. 2679-2697 19 p. |
article |
|
| 83 | Stability of two player game structures |
Polyméris, Andreas |
2008 |
81-90 | 14 |
p. 2636-2646 11 p. |
article |
|
| 84 | Sweeping an oval to a vanishing point |
Dumitrescu, Adrian |
2011 |
81-90 | 14 |
p. 1436-1442 7 p. |
article |
|
| 85 | The bipartite edge frustration of composite graphs |
Yarahmadi, Z. |
2010 |
81-90 | 14 |
p. 1551-1558 8 p. |
article |
|
| 86 | The extremal values of the Wiener index of a tree with given degree sequence |
Wang, Hua |
2008 |
81-90 | 14 |
p. 2647-2654 8 p. |
article |
|
| 87 | The ( α , β , s , t ) -diameter of graphs: A particular case of conditional diameter |
Rodríguez, J.A. |
2006 |
81-90 | 14 |
p. 2024-2031 8 p. |
article |
|
| 88 | The unambiguity of segmented morphisms |
Freydenberger, Dominik D. |
2009 |
81-90 | 14 |
p. 3055-3068 14 p. |
article |
|
| 89 | Ultrametrics, Banach’s fixed point theorem and the Riordan group |
Luzón, Ana |
2008 |
81-90 | 14 |
p. 2620-2635 16 p. |
article |
|
| 90 | 1-vertex-fault-tolerant cycles embedding on folded hypercubes |
Hsieh, Sun-Yuan |
2009 |
81-90 | 14 |
p. 3094-3098 5 p. |
article |
90 results found