Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             140 results found
no title author magazine year volume issue page(s) type
1 A generalization of Calkin's identity Zhang, Zhizheng
2008
17 p. 3992-3997
6 p.
article
2 Almost all graphs are rigid—revisited Kötters, Jens
2009
17 p. 5420-5424
5 p.
article
3 A new characterization of perfect graphs Galeana-Sánchez, Hortensia
2012
17 p. 2751-2755
5 p.
article
4 A note on clone sets in representable matroids Reid, Talmage J.
2006
17 p. 2128-2130
3 p.
article
5 A note on maximal progression-free sets Savchev, Svetoslav
2006
17 p. 2131-2133
3 p.
article
6 A note on the monotonicity of mixed Ramsey numbers Axenovich, Maria
2011
17 p. 2020-2023
4 p.
article
7 A note on the recognition of bisplit graphs Abueida, Atif
2006
17 p. 2108-2110
3 p.
article
8 Another proof of the 5-choosability of K 5 -minor-free graphs He, Wenjie
2008
17 p. 4024-4026
3 p.
article
9 An update on the middle levels problem Shields, Ian
2009
17 p. 5271-5277
7 p.
article
10 A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem Yao, Guohui
2008
17 p. 3951-3959
9 p.
article
11 A recursive construction for universal cycles of 2-subspaces Jackson, Bradley W.
2009
17 p. 5328-5331
4 p.
article
12 Arithmetic properties of q-Fibonacci numbers and q-pell numbers Pan, Hao
2006
17 p. 2118-2127
10 p.
article
13 Bandwidth of the corona of two graphs Kojima, Toru
2008
17 p. 3770-3781
12 p.
article
14 Cayley graphs as classifiers for data mining: The influence of asymmetries Kelarev, Andrei
2009
17 p. 5360-5369
10 p.
article
15 Classification of a family of symmetric graphs with complete 2-arc-transitive quotients Zhou, Sanming
2009
17 p. 5404-5410
7 p.
article
16 Classification of extremal double circulant self-dual codes of lengths 74–88 Gulliver, T. Aaron
2006
17 p. 2064-2072
9 p.
article
17 Collapsible biclaw-free graphs Lai, Hong-Jian
2006
17 p. 2115-2117
3 p.
article
18 Configurations in projective planes and quadrilateral-star Ramsey numbers Monte Carmelo, E.L.
2008
17 p. 3986-3991
6 p.
article
19 Congruences for generalized Frobenius partitions with 4 colors Baruah, Nayandeep Deka
2011
17 p. 1892-1902
11 p.
article
20 Connected graphs as subgraphs of Cayley graphs: Conditions on Hamiltonicity Qin, Yong
2009
17 p. 5426-5431
6 p.
article
21 Contents 2006
17 p. vii-viii
nvt p.
article
22 Dense edge-magic graphs and thin additive bases Pikhurko, Oleg
2006
17 p. 2097-2107
11 p.
article
23 Density and power graphs in graph homomorphism problem Daneshgar, Amir
2008
17 p. 4027-4030
4 p.
article
24 Describing ( d − 2 ) -stars at d -vertices, d ≤ 5 , in normal plane maps Borodin, Oleg V.
2013
17 p. 1700-1709
10 p.
article
25 Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5 Borodin, Oleg V.
2013
17 p. 1710-1714
5 p.
article
26 Diameter, connectivity, and phase transition of the uniform random intersection graph Rybarczyk, Katarzyna
2011
17 p. 1998-2019
22 p.
article
27 Disjoint triangles and quadrilaterals in a graph Yan, Jin
2008
17 p. 3930-3937
8 p.
article
28 Distance domination versus iterated domination Bacsó, Gábor
2012
17 p. 2672-2675
4 p.
article
29 Distance two labelling and direct products of graphs Lin, Wensong
2008
17 p. 3805-3815
11 p.
article
30 Dual concepts of almost distance-regularity and the spectral excess theorem Dalfó, C.
2012
17 p. 2730-2734
5 p.
article
31 Edge-connectivity of permutation hypergraphs Jami, Neil
2012
17 p. 2536-2539
4 p.
article
32 Editorial board 2006
17 p. v-vi
nvt p.
article
33 Eigenvalues of complete multipartite graphs Delorme, C.
2012
17 p. 2532-2535
4 p.
article
34 Endpoint extendable paths in dense graphs Chen, Guantao
2012
17 p. 2584-2592
9 p.
article
35 Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices Walsh, Timothy R.S.
2012
17 p. 2660-2671
12 p.
article
36 Even and odd diagonals in doubly stochastic matrices von Below, Joachim
2008
17 p. 3917-3929
13 p.
article
37 Even cycle decompositions of 4-regular graphs and line graphs Markström, Klas
2012
17 p. 2676-2681
6 p.
article
38 Evidence for a forbidden configuration conjecture: One more case solved Anstee, R.P.
2012
17 p. 2720-2729
10 p.
article
39 Extendable local partial clones Romov, B.A.
2008
17 p. 3744-3760
17 p.
article
40 Facial parity edge colouring of plane pseudographs Czap, Július
2012
17 p. 2735-2740
6 p.
article
41 Foldings in graphs and relations with simplicial complexes and posets Fieux, E.
2012
17 p. 2639-2651
13 p.
article
42 Generalized symmetry of graphs — A survey Fan, Suohai
2009
17 p. 5411-5419
9 p.
article
43 Generic algorithms for some decision problems on fasciagraphs and rotagraphs Bouznif, Marwane
2012
17 p. 2707-2719
13 p.
article
44 Graphs whose endomorphism monoids are regular Hou, Hailong
2008
17 p. 3888-3896
9 p.
article
45 Gray codes for column-convex polyominoes and a new class of distributive lattices Chow, Stirling
2009
17 p. 5284-5297
14 p.
article
46 Gray codes with bounded weights Dvořák, Tomáš
2012
17 p. 2599-2611
13 p.
article
47 Guide for authors 2006
17 p. I-IV
nvt p.
article
48 Hamilton cycles and paths in vertex-transitive graphs—Current directions Kutnar, Klavdija
2009
17 p. 5491-5500
10 p.
article
49 Hamilton cycles in graph bundles over a cycle with tree as a fibre Pisanski, Tomaž
2009
17 p. 5432-5436
5 p.
article
50 Hamiltonian cycles in ( 2 , 3 , c ) -circulant digraphs Morris, Dave Witte
2009
17 p. 5484-5490
7 p.
article
51 Hamiltonian paths in Cayley graphs Pak, Igor
2009
17 p. 5501-5508
8 p.
article
52 Hamilton paths and cycles in vertex-transitive graphs of order 6 p Kutnar, Klavdija
2009
17 p. 5444-5460
17 p.
article
53 Harmonic labeling of graphs Benjamini, Itai
2013
17 p. 1726-1745
20 p.
article
54 Heterochromatic tree partition numbers for complete bipartite graphs Chen, He
2008
17 p. 3871-3878
8 p.
article
55 Incompleteness of the Giulietti–Ughi arc for large primes Ghosh, Rohit
2008
17 p. 3824-3835
12 p.
article
56 Indefinite summation with unspecified summands Kauers, Manuel
2006
17 p. 2073-2083
11 p.
article
57 Integral complete multipartite graphs Wang, Ligong
2008
17 p. 3860-3870
11 p.
article
58 Intersection graphs of ideals of rings Chakrabarty, Ivy
2009
17 p. 5381-5392
12 p.
article
59 Isometric path numbers of graphs Pan, Jun-Jie
2006
17 p. 2091-2096
6 p.
article
60 Linear choosability of graphs Esperet, Louis
2008
17 p. 3938-3950
13 p.
article
61 Linear choosability of sparse graphs Cranston, Daniel W.
2011
17 p. 1910-1917
8 p.
article
62 List monopolar partitions of claw-free graphs Churchley, Ross
2012
17 p. 2545-2549
5 p.
article
63 Local topology of the free complex of a two-dimensional generalized convex shelling Okamoto, Yoshio
2008
17 p. 3836-3846
11 p.
article
64 Locating–dominating codes in paths Exoo, Geoffrey
2011
17 p. 1863-1873
11 p.
article
65 Locating pairs of vertices on Hamiltonian cycles Faudree, Ralph J.
2012
17 p. 2700-2706
7 p.
article
66 Max-multiflow/min-multicut for G + H series-parallel Cornaz, Denis
2011
17 p. 1957-1967
11 p.
article
67 Minimal homogeneous latin trades Cavenagh, Nicholas J.
2006
17 p. 2047-2055
9 p.
article
68 Minimum Eulerian circuits and minimum de Bruijn sequences Matamala, Martín
2009
17 p. 5298-5304
7 p.
article
69 Mutually independent hamiltonian cycles for the pancake graphs and the star graphs Lin, Cheng-Kuan
2009
17 p. 5474-5483
10 p.
article
70 25 new r -self-orthogonal Latin squares Zhang, Hantao
2013
17 p. 1746-1753
8 p.
article
71 Nomadic decompositions of bidirected complete graphs Cranston, Daniel W.
2008
17 p. 3982-3985
4 p.
article
72 Non-trivial intersecting uniform sub-families of hereditary families Borg, Peter
2013
17 p. 1754-1761
8 p.
article
73 [No title] Li, Hao
2012
17 p. 2531-
1 p.
article
74 Nowhere-zero 3-flows and Z 3 -connectivity of a family of graphs Yan, Jin
2011
17 p. 1988-1994
7 p.
article
75 On a conjecture of Murty and Simon on diameter 2-critical graphs Haynes, Teresa W.
2011
17 p. 1918-1924
7 p.
article
76 On a Heilbronn-type problem Diao, Hansheng
2008
17 p. 3960-3981
22 p.
article
77 On a Lovász-type lemma, applied to Brooks’ theorem for list-colouring Tverberg, Helge
2011
17 p. 1995-1997
3 p.
article
78 On an empty triangle with the maximum area in planar point sets Hosono, Kiyoshi
2011
17 p. 1886-1891
6 p.
article
79 On a proper acute triangulation of a polyhedral surface Maehara, H.
2011
17 p. 1903-1909
7 p.
article
80 On cocircuit covers of bicircular matroids McNulty, Jennifer
2008
17 p. 4008-4013
6 p.
article
81 On constructions for two dimensional balanced sampling plan excluding contiguous units with block size four Kong, Hairong
2008
17 p. 3729-3743
15 p.
article
82 On even cycle decompositions of 4-regular line graphs Máčajová, Edita
2013
17 p. 1697-1699
3 p.
article
83 On Hamiltonicity of circulant digraphs of outdegree three Miklavič, Štefko
2009
17 p. 5437-5443
7 p.
article
84 On planar and non-planar graphs having no chromatic zeros in the interval ( 1 , 2 ) Dong, F.M.
2008
17 p. 3897-3905
9 p.
article
85 On removable edges in 3-connected cubic graphs Fouquet, Jean-Luc
2012
17 p. 2652-2659
8 p.
article
86 On stable cycles and cycle double covers of graphs with large circumference Hägglund, Jonas
2012
17 p. 2540-2544
5 p.
article
87 On symplectic graphs modulo p n Meemark, Yotsanan
2011
17 p. 1874-1878
5 p.
article
88 On the adjacent vertex distinguishing total coloring numbers of graphs with Δ = 3 Chen, Xiang’en
2008
17 p. 4003-4007
5 p.
article
89 On the coloring of the annihilating-ideal graph of a commutative ring Aalipour, G.
2012
17 p. 2620-2626
7 p.
article
90 On the difference between chromatic number and dynamic chromatic number of graphs Ahadi, A.
2012
17 p. 2579-2583
5 p.
article
91 On the existence of symmetric chain decompositions in a quotient of the Boolean lattice Jiang, Zongliang
2009
17 p. 5278-5283
6 p.
article
92 On the extendability of certain semi-Cayley graphs of finite abelian groups Gao, Xing
2011
17 p. 1978-1987
10 p.
article
93 On the extension of vertex maps to graph homomorphisms Agnarsson, Geir
2006
17 p. 2021-2030
10 p.
article
94 On the Hamilton connectivity of generalized Petersen graphs Alspach, Brian
2009
17 p. 5461-5473
13 p.
article
95 On the hardness of recognizing triangular line graphs Anand, Pranav
2012
17 p. 2627-2638
12 p.
article
96 On the minimum average distance of binary constant weight codes Xia, Shu-Tao
2008
17 p. 3847-3859
13 p.
article
97 On the minimum degree forcing F-free graphs to be (nearly) bipartite Łuczak, Tomasz
2008
17 p. 3998-4002
5 p.
article
98 On the page number of complete odd-partite graphs Sperfeld, Konrad
2013
17 p. 1689-1696
8 p.
article
99 On the size of the symmetry group of a perfect code Heden, Olof
2011
17 p. 1879-1885
7 p.
article
100 On transitive Cayley graphs of strong semilattices of right (left) groups Panma, S.
2009
17 p. 5393-5403
11 p.
article
101 On two variations of identifying codes Delmas, Olivier
2011
17 p. 1948-1956
9 p.
article
102 On universal cycles for multisets Hurlbert, Glenn
2009
17 p. 5321-5327
7 p.
article
103 On unretractive graphs Kaschek, Roland
2009
17 p. 5370-5380
11 p.
article
104 Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs Ning, Bo
2013
17 p. 1715-1725
11 p.
article
105 Pair lengths of product graphs Christofides, Demetres
2006
17 p. 2111-2114
4 p.
article
106 Partitioning a graph into convex sets Artigas, D.
2011
17 p. 1968-1977
10 p.
article
107 Path transferability of graphs Torii, Ryuzo
2008
17 p. 3782-3804
23 p.
article
108 Plane graphs without cycles of length 4 , 6 , 7 or 8 are 3-colorable Wang, Yingqian
2008
17 p. 4014-4017
4 p.
article
109 Preface Knauer, Ulrich
2009
17 p. 5349-5351
3 p.
article
110 Preface Stevens, Brett
2009
17 p. 5255-5258
4 p.
article
111 Preface Marušič, Dragan
2009
17 p. 5425-
1 p.
article
112 Proper connection of graphs Borozan, Valentin
2012
17 p. 2550-2560
11 p.
article
113 Rainbow-free colorings for x + y = c z in Z p Llano, Bernardo
2012
17 p. 2566-2573
8 p.
article
114 Rainbow solutions of linear equations over Z p Conlon, David
2006
17 p. 2056-2063
8 p.
article
115 Ratios of some domination parameters in trees Chellali, Mustapha
2008
17 p. 3879-3887
9 p.
article
116 Recursive constructions of small regular graphs of given degree and girth Exoo, Geoffrey
2012
17 p. 2612-2619
8 p.
article
117 Research problems on Gray codes and universal cycles Jackson, Brad
2009
17 p. 5341-5348
8 p.
article
118 Semisymmetric graphs Feng, Yan-Quan
2008
17 p. 4031-4035
5 p.
article
119 Some bounds on the p-domination number in trees Blidia, Mostafa
2006
17 p. 2031-2037
7 p.
article
120 Some criteria for a graph to be Class 1 Akbari, S.
2012
17 p. 2593-2598
6 p.
article
121 Spanning trees with specified differences in Cayley graphs Seamone, Ben
2012
17 p. 2561-2565
5 p.
article
122 Star subdivisions and connected even factors in the square of a graph Ekstein, Jan
2012
17 p. 2574-2578
5 p.
article
123 Sufficient conditions for the existence of spanning colored trees in edge-colored graphs Águeda, R.
2012
17 p. 2694-2699
6 p.
article
124 The adjacent vertex distinguishing total chromatic number Coker, Tom
2012
17 p. 2741-2750
10 p.
article
125 The congruence classes of paths and cycles Michels, Martin A.
2009
17 p. 5352-5359
8 p.
article
126 The coolest way to generate combinations Ruskey, Frank
2009
17 p. 5305-5320
16 p.
article
127 The directed genus of the de Bruijn graph Hales, Alfred W.
2009
17 p. 5259-5263
5 p.
article
128 The edge spectrum of the saturation number for small paths Gould, Ronald J.
2012
17 p. 2682-2689
8 p.
article
129 The Eulerian generating function of q-derangements Srinivasan, Murali K.
2006
17 p. 2134-2140
7 p.
article
130 The linear 3-arboricity of K n , n and K n Fu, Hung-Lin
2008
17 p. 3816-3823
8 p.
article
131 The maximum number of maximal independent sets in unicyclic connected graphs Koh, K.M.
2008
17 p. 3761-3769
9 p.
article
132 The Monochromatic Column problem Srivastava, Ashish K.
2008
17 p. 3906-3916
11 p.
article
133 The number of vertices of degree 5 in a contraction-critically 5-connected graph Ando, Kiyoshi
2011
17 p. 1925-1939
15 p.
article
134 The total chromatic number of split-indifference graphs Campos, C.N.
2012
17 p. 2690-2693
4 p.
article
135 Total domination and total domination subdivision number of a graph and its complement Favaron, O.
2008
17 p. 4018-4023
6 p.
article
136 Unbalanced bipartite factorizations of complete bipartite graphs Martin, Nigel
2006
17 p. 2084-2090
7 p.
article
137 Universal cycles for permutations Robert Johnson, J.
2009
17 p. 5264-5270
7 p.
article
138 Universal cycles of ( n − 1 ) -partitions of an n -set Casteels, Karel
2009
17 p. 5332-5340
9 p.
article
139 Varieties of algebras arising from K-perfect m-cycle systems Brier, Robert
2006
17 p. 2038-2046
9 p.
article
140 Weighted Davenport’s constant and the weighted EGZ Theorem Zeng, Xiangneng
2011
17 p. 1940-1947
8 p.
article
                             140 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands