Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             91 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A census of genus-two 3-manifolds up to 42 coloured tetrahedra Bandieri, Paola
2010
19 p. 2469-2481
13 p.
artikel
2 Achromatic number of collections of paths and cycles Edwards, Keith J.
2013
19 p. 1856-1860
5 p.
artikel
3 A dedication to Professor Gary Chartrand Haynes, Teresa W.
2009
19 p. 5803-5805
3 p.
artikel
4 A note on powers of Hamilton cycles in generalized claw-free graphs Faudree, Ralph J.
2013
19 p. 1915-1917
3 p.
artikel
5 A note on the symmetry group of full rank perfect binary codes Heden, Olof
2012
19 p. 2973-2977
5 p.
artikel
6 A random intersection digraph: Indegree and outdegree distributions Bloznelis, Mindaugas
2010
19 p. 2560-2566
7 p.
artikel
7 Arbitrarily large difference between d -strong chromatic index and its trivial lower bound Mockovčiaková, Martina
2013
19 p. 2000-2006
7 p.
artikel
8 A short proof of the versatile version of Fleischner’s theorem Müttel, Janina
2013
19 p. 1929-1933
5 p.
artikel
9 A survey of stratified domination in graphs Haynes, Teresa W.
2009
19 p. 5806-5819
14 p.
artikel
10 Balanced degree-magic complements of bipartite graphs Bezegová, L’udmila
2013
19 p. 1918-1923
6 p.
artikel
11 Characterizing paths as m -step competition graphs Kuhl, Jaromy
2010
19 p. 2555-2559
5 p.
artikel
12 Circumferences of 2-factors in claw-free graphs Čada, Roman
2013
19 p. 1934-1943
10 p.
artikel
13 Color-bounded hypergraphs, VI: Structural and functional jumps in complexity Bujtás, Csilla
2013
19 p. 1965-1977
13 p.
artikel
14 Coloring vertices and faces of maps on surfaces Korzhik, Vladimir P.
2010
19 p. 2504-2509
6 p.
artikel
15 Color the cycles Katona, Gyula O.H.
2013
19 p. 2026-2033
8 p.
artikel
16 Connected graphs without long paths Balister, P.N.
2008
19 p. 4487-4494
8 p.
artikel
17 Constructions of non-principal families in extremal hypergraph theory Mubayi, Dhruv
2008
19 p. 4430-4434
5 p.
artikel
18 Covering the n -space by convex bodies and its chromatic number Füredi, Z.
2008
19 p. 4495-4500
6 p.
artikel
19 Cubic factorizations Rosenfeld, Moshe
2013
19 p. 1952-1960
9 p.
artikel
20 Cycles in squares of trees without generalized claws Brandt, Stephan
2013
19 p. 1989-1999
11 p.
artikel
21 Density of constant radius normal binary covering codes Ellis, Robert B.
2008
19 p. 4446-4459
14 p.
artikel
22 Disjoint unions of complete minors Thomason, Andrew
2008
19 p. 4370-4377
8 p.
artikel
23 Domination with exponential decay Dankelmann, Peter
2009
19 p. 5877-5883
7 p.
artikel
24 Enumeration and limit laws of dissections on a cylinder Rué, Juanjo
2010
19 p. 2519-2541
23 p.
artikel
25 Fair domination in graphs Caro, Yair
2012
19 p. 2905-2914
10 p.
artikel
26 Forbidden subgraphs generating a finite set Fujisawa, Jun
2013
19 p. 1835-1842
8 p.
artikel
27 Generalizations of Dirac’s theorem in Hamiltonian graph theory—A survey Li, Hao
2013
19 p. 2034-2053
20 p.
artikel
28 Genus distribution of P 3 □ P n Khan, Imran F.
2012
19 p. 2863-2871
9 p.
artikel
29 Growing perfect cubes Horváth, Márk
2008
19 p. 4378-4388
11 p.
artikel
30 Guest Editors’ Foreword Füredi, Zoltán
2008
19 p. 4305-
1 p.
artikel
31 Guides and shortcuts in graphs Mulder, Henry Martyn
2013
19 p. 1897-1907
11 p.
artikel
32 Highly non-concurrent longest cycles in lattice graphs Shabbir, Ayesha
2013
19 p. 1908-1914
7 p.
artikel
33 Irregularity strength of digraphs Ferrara, Mike
2009
19 p. 5834-5840
7 p.
artikel
34 Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes Balbuena, C.
2013
19 p. 2014-2019
6 p.
artikel
35 Liar’s domination in graphs Roden, Miranda L.
2009
19 p. 5884-5890
7 p.
artikel
36 Lifting simplicial complexes to the boundary of convex polytopes Pournin, Lionel
2012
19 p. 2849-2862
14 p.
artikel
37 Long alternating paths in bicolored point sets Kynčl, Jan
2008
19 p. 4315-4321
7 p.
artikel
38 Long paths with endpoints in given vertex-subsets of graphs Li, Hao
2008
19 p. 4518-4529
12 p.
artikel
39 3-maps Craft, David L.
2009
19 p. 5857-5869
13 p.
artikel
40 Nonrepetitive colorings of graphs of bounded tree-width Kündgen, André
2008
19 p. 4473-4478
6 p.
artikel
41 Note on the 3-graph counting lemma Nagle, Brendan
2008
19 p. 4501-4517
17 p.
artikel
42 Obstructions to partitions of chordal graphs Feder, Tomás
2013
19 p. 1861-1871
11 p.
artikel
43 On convexification of polygons by pops Dumitrescu, Adrian
2010
19 p. 2542-2545
4 p.
artikel
44 On covering vertices of a graph by trees Horak, P.
2008
19 p. 4414-4418
5 p.
artikel
45 On dissimilarity vectors of general weighted trees Rubei, Elena
2012
19 p. 2872-2880
9 p.
artikel
46 On doubly light triangles in plane graphs Hudák, Peter
2013
19 p. 1978-1988
11 p.
artikel
47 On embedding well-separable graphs Csaba, Béla
2008
19 p. 4322-4331
10 p.
artikel
48 On global domination critical graphs Dutton, Ronald D.
2009
19 p. 5894-5897
4 p.
artikel
49 On K s , t -minors in graphs with given average degree Kostochka, Alexandr
2008
19 p. 4435-4445
11 p.
artikel
50 On Ramsey ( K 1 , m , G ) -minimal graphs Borowiecka-Olszewska, Marta
2013
19 p. 1843-1855
13 p.
artikel
51 On 3-Steiner simplicial orderings Cáceres, Jóse
2009
19 p. 5828-5833
6 p.
artikel
52 On the circumference of a graph and its complement Faudree, R.J.
2009
19 p. 5891-5893
3 p.
artikel
53 On the maximum size of minimal definitive quartet sets Dowden, Chris
2010
19 p. 2546-2549
4 p.
artikel
54 On the structure of strong 3-quasi-transitive digraphs Galeana-Sánchez, Hortensia
2010
19 p. 2495-2498
4 p.
artikel
55 Partitioning graphs into complete and empty graphs Ekim, Tınaz
2009
19 p. 5849-5856
8 p.
artikel
56 Pentagons vs. triangles Bollobás, Béla
2008
19 p. 4332-4336
5 p.
artikel
57 Planar Ramsey numbers for cycles Gorgol, Izolda
2008
19 p. 4389-4395
7 p.
artikel
58 Preface Horňák, Mirko
2013
19 p. 1833-1834
2 p.
artikel
59 Problems and results in extremal combinatorics—II Alon, Noga
2008
19 p. 4460-4472
13 p.
artikel
60 Problems on cycles and colorings Tuza, Zsolt
2013
19 p. 2007-2013
7 p.
artikel
61 Proof of a conjectured q , t -Schröder identity Keith, William J.
2010
19 p. 2489-2494
6 p.
artikel
62 Quadripartite version of the Hajnal–Szemerédi theorem Martin, Ryan
2008
19 p. 4337-4360
24 p.
artikel
63 Rainbow C 3 ’s and C 4 ’s in edge-colored graphs Li, Hao
2013
19 p. 1893-1896
4 p.
artikel
64 Rainbow edge-coloring and rainbow domination LeSaulnier, Timothy D.
2013
19 p. 2020-2025
6 p.
artikel
65 Relating edge-coverings to the classification of Z 2 k -magic graphs Choi, Jeong Ok
2012
19 p. 2938-2945
8 p.
artikel
66 Secure domination critical graphs Grobler, P.J.P.
2009
19 p. 5820-5827
8 p.
artikel
67 Shift graphs on precompact families of finite sets of natural numbers Di Prisco, Carlos A.
2012
19 p. 2915-2926
12 p.
artikel
68 Some remarks on vertex Folkman numbers for hypergraphs Dudek, Andrzej
2012
19 p. 2952-2957
6 p.
artikel
69 Structures and lower bounds for binary covering arrays Choi, Soohak
2012
19 p. 2958-2968
11 p.
artikel
70 Subdivisions of graphs: A generalization of paths and cycles Sobhan Babu, Ch.
2008
19 p. 4479-4486
8 p.
artikel
71 Sufficient conditions for maximally restricted edge connected graphs Qin, Yingying
2012
19 p. 2969-2972
4 p.
artikel
72 The Cameron–Erdős conjecture Sapozhenko, Alexander A.
2008
19 p. 4361-4369
9 p.
artikel
73 The convex hull of degree sequences of signed graphs Jordon, Heather
2009
19 p. 5841-5848
8 p.
artikel
74 The empire problem in even embeddings on closed surfaces with ε ≤ 0 Noguchi, Kenta
2013
19 p. 1944-1951
8 p.
artikel
75 The 2-extendability of 5-connected graphs on the Klein bottle Negami, Seiya
2010
19 p. 2510-2518
9 p.
artikel
76 The independent set sequence of regular bipartite graphs Galvin, David
2012
19 p. 2881-2892
12 p.
artikel
77 The intersection numbers of KTSs with a common parallel class Li, Yannan
2012
19 p. 2893-2904
12 p.
artikel
78 The minimum size of k -rainbow connected graphs of given order Bode, Jens-P.
2013
19 p. 1924-1928
5 p.
artikel
79 The number of C 3 ⃗ -free vertices on 3-partite tournaments Figueroa, Ana Paulina
2010
19 p. 2482-2488
7 p.
artikel
80 The pebbling threshold of the square of cliques Bekmetjev, A.
2008
19 p. 4306-4314
9 p.
artikel
81 The property of k -colourable graphs is uniquely decomposable Broere, Izak
2013
19 p. 1961-1964
4 p.
artikel
82 The rainbow connection number of 2-connected graphs Ekstein, Jan
2013
19 p. 1884-1892
9 p.
artikel
83 The run transform Callan, David
2012
19 p. 2927-2937
11 p.
artikel
84 The smallest one-realization of a given set II Zhao, Ping
2012
19 p. 2946-2951
6 p.
artikel
85 Thue type problems for graphs, points, and numbers Grytczuk, Jarosław
2008
19 p. 4419-4429
11 p.
artikel
86 t K p -saturated graphs of minimum size Faudree, Ralph
2009
19 p. 5870-5876
7 p.
artikel
87 Toppling kings in multipartite tournaments by introducing new kings Brcanov, Dejan
2010
19 p. 2550-2554
5 p.
artikel
88 Triple metamorphosis of twofold triple systems Lindner, C.C.
2013
19 p. 1872-1883
12 p.
artikel
89 Unavoidable subgraphs of colored graphs Cutler, Jonathan
2008
19 p. 4396-4413
18 p.
artikel
90 Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree Lichiardopol, Nicolas
2010
19 p. 2567-2570
4 p.
artikel
91 Vertex-disjoint triangles in K 1 , t -free graphs with minimum degree at least t Zhang, Xin
2010
19 p. 2499-2503
5 p.
artikel
                             91 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland