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
 
                             84 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A characterization of cocircuit graphs of uniform oriented matroids Montellano-Ballesteros, Juan José
2006
4 p. 445-454
10 p.
artikel
2 A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs Grannell, M.J.
2008
4 p. 637-650
14 p.
artikel
3 Amalgamations of factorizations of complete graphs Johnson, Matthew
2007
4 p. 597-611
15 p.
artikel
4 An algorithm for weighted fractional matroid matching Gijswijt, Dion
2013
4 p. 509-520
12 p.
artikel
5 A new generalization of Mantel's theorem to k-graphs Mubayi, Dhruv
2007
4 p. 669-678
10 p.
artikel
6 Approximating clique-width and branch-width Oum, Sang-il
2006
4 p. 514-528
15 p.
artikel
7 A proof of Cunninghamʼs conjecture on restricted subgraphs and jump systems Kobayashi, Yusuke
2012
4 p. 948-966
19 p.
artikel
8 A relation between choosability and uniquely list colorability Akbari, Saieed
2006
4 p. 577-583
7 p.
artikel
9 A relaxed Hadwiger's Conjecture for list colorings Kawarabayashi, Ken-ichi
2007
4 p. 647-651
5 p.
artikel
10 Bounded fractionality of the multiflow feasibility problem for demand graph K 3 + K 3 and related maximization problems Hirai, Hiroshi
2012
4 p. 875-899
25 p.
artikel
11 Circular edge-colorings of cubic graphs with girth six Král', Daniel
2010
4 p. 351-358
8 p.
artikel
12 Classification of nonorientable regular embeddings of complete bipartite graphs Kwak, Jin Ho
2011
4 p. 191-205
15 p.
artikel
13 Classification of regular maps of Euler characteristic − 3 p Conder, Marston
2012
4 p. 967-981
15 p.
artikel
14 Claw-free graphs. III. Circular interval graphs Chudnovsky, Maria
2008
4 p. 812-834
23 p.
artikel
15 Congruence conditions, parcels, and Tutte polynomials of graphs and matroids Kung, Joseph P.S.
2012
4 p. 996-1019
24 p.
artikel
16 Connectivity keeping edges in graphs with large minimum degree Fujita, Shinya
2008
4 p. 805-811
7 p.
artikel
17 Contractions of 6-connected toroidal graphs Fijavž, Gašper
2007
4 p. 553-570
18 p.
artikel
18 Corrigendum to “Counting connected graphs inside-out” [J. Combin. Theory Ser. B 93 (2005) 127–172] Pittel, Boris
2008
4 p. 835-837
3 p.
artikel
19 Crossing-critical graphs with large maximum degree Dvořák, Zdeněk
2010
4 p. 413-417
5 p.
artikel
20 Crossing number is hard for cubic graphs Hliněný, Petr
2006
4 p. 455-471
17 p.
artikel
21 Cubic symmetric graphs of order a small number times a prime or a prime square Feng, Yan-Quan
2007
4 p. 627-646
20 p.
artikel
22 Cycle spectra of Hamiltonian graphs Milans, Kevin G.
2012
4 p. 869-874
6 p.
artikel
23 Decomposing a graph into bistars Thomassen, Carsten
2013
4 p. 504-508
5 p.
artikel
24 Decomposing a planar graph of girth 5 into an independent set and a forest Kawarabayashi, Ken-ichi
2009
4 p. 674-684
11 p.
artikel
25 Distance constraints in graph color extensions Hutchinson, Joan P.
2007
4 p. 501-517
17 p.
artikel
26 Editorial Board 2010
4 p. IFC-
1 p.
artikel
27 Editorial Board 2006
4 p. i-
1 p.
artikel
28 Editorial Board 2008
4 p. i-
1 p.
artikel
29 Editorial Board 2007
4 p. i-
1 p.
artikel
30 Editorial Board 2013
4 p. i-
1 p.
artikel
31 Editorial Board 2012
4 p. i-
1 p.
artikel
32 Editorial Board 2011
4 p. i-
1 p.
artikel
33 Eigenvalue bounds for independent sets Godsil, C.D.
2008
4 p. 721-734
14 p.
artikel
34 End spaces of graphs are normal Sprüssel, Philipp
2008
4 p. 798-804
7 p.
artikel
35 Every 3-connected, essentially 11-connected line graph is Hamiltonian Lai, Hong-Jian
2006
4 p. 571-576
6 p.
artikel
36 Exponentially many 5-list-colorings of planar graphs Thomassen, Carsten
2007
4 p. 571-583
13 p.
artikel
37 Extending precolorings to circular colorings Albertson, Michael O.
2006
4 p. 472-481
10 p.
artikel
38 Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic ϵ ∈ { − 1 , − 2 , − 3 } Luo, Rong
2008
4 p. 707-720
14 p.
artikel
39 Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem Kawarabayashi, Ken-ichi
2012
4 p. 1020-1034
15 p.
artikel
40 Flows and parity subgraphs of graphs with large odd-edge-connectivity Shu, Jinlong
2012
4 p. 839-851
13 p.
artikel
41 From the plane to higher surfaces Kawarabayashi, Ken-ichi
2012
4 p. 852-868
17 p.
artikel
42 Generation and properties of snarks Brinkmann, Gunnar
2013
4 p. 468-488
21 p.
artikel
43 Hamiltonian degree sequences in digraphs Kühn, Daniela
2010
4 p. 367-380
14 p.
artikel
44 Hamiltonicity in 3-connected claw-free graphs Lai, Hong-Jian
2006
4 p. 493-504
12 p.
artikel
45 Homeomorphically irreducible spanning trees Chen, Guantao
2013
4 p. 409-414
6 p.
artikel
46 Induced subgraphs of Ramsey graphs with many distinct degrees Bukh, Boris
2007
4 p. 612-619
8 p.
artikel
47 Is the five-flow conjecture almost false? Jacobsen, Jesper Lykke
2013
4 p. 532-565
34 p.
artikel
48 Linked graphs with restricted lengths Chen, Guantao
2008
4 p. 735-751
17 p.
artikel
49 List of Forthcoming Articles 2008
4 p. 838-
1 p.
artikel
50 List of Forthcoming Articles 2007
4 p. 679-
1 p.
artikel
51 Minimal bricks Norine, Serguei
2006
4 p. 505-513
9 p.
artikel
52 Minmax relations for cyclically ordered digraphs Sebő, András
2007
4 p. 518-552
35 p.
artikel
53 Monochromatic triangles in three-coloured graphs Cummings, James
2013
4 p. 489-503
15 p.
artikel
54 Note on coloring graphs without odd- K k -minors Kawarabayashi, Ken-ichi
2009
4 p. 728-731
4 p.
artikel
55 Obstructions to branch-decomposition of matroids Geelen, J.
2006
4 p. 560-570
11 p.
artikel
56 On a family of strongly regular graphs with λ = 1 Bondarenko, Andriy V.
2013
4 p. 521-531
11 p.
artikel
57 On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes Chepoi, Victor
2013
4 p. 428-467
40 p.
artikel
58 On excluded minors for real-representability Mayhew, Dillon
2009
4 p. 685-689
5 p.
artikel
59 On graphs with no induced subdivision of K 4 Lévêque, Benjamin
2012
4 p. 924-947
24 p.
artikel
60 On the chromatic number of an oriented matroid Hochstättler, Winfried
2008
4 p. 698-706
9 p.
artikel
61 On the isoperimetric spectrum of graphs and its approximations Daneshgar, Amir
2010
4 p. 390-412
23 p.
artikel
62 On the regularity of maps Jones, Gareth A.
2008
4 p. 631-636
6 p.
artikel
63 Paths with two blocks in n-chromatic digraphs Addario-Berry, L.
2007
4 p. 620-626
7 p.
artikel
64 Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable Borodin, O.V.
2009
4 p. 668-673
6 p.
artikel
65 Random graphs on surfaces McDiarmid, Colin
2008
4 p. 778-797
20 p.
artikel
66 Reducing Hajós' 4-coloring conjecture to 4-connected graphs Yu, Xingxing
2006
4 p. 482-492
11 p.
artikel
67 Relaxed two-coloring of cubic graphs Berke, Robert
2007
4 p. 652-668
17 p.
artikel
68 Removing even crossings Pelsmajer, Michael J.
2007
4 p. 489-500
12 p.
artikel
69 Short paths in quasi-random triple systems with sparse underlying graphs Polcyn, Joanna
2006
4 p. 584-607
24 p.
artikel
70 Smallest counterexample to the 5-flow conjecture has girth at least eleven Kochol, Martin
2010
4 p. 381-389
9 p.
artikel
71 Spanning 3-colourable subgraphs of small bandwidth in dense graphs Böttcher, Julia
2008
4 p. 752-777
26 p.
artikel
72 Sparse halves in triangle-free graphs Keevash, Peter
2006
4 p. 614-620
7 p.
artikel
73 Strongly regular graphs from unions of cyclotomic classes Feng, Tao
2012
4 p. 982-995
14 p.
artikel
74 Tales of Hoffman: Three extensions of Hoffman's bound on the graph chromatic number Bilu, Yonatan
2006
4 p. 608-613
6 p.
artikel
75 Tangles, tree-decompositions and grids in matroids Geelen, Jim
2009
4 p. 657-667
11 p.
artikel
76 The 3-colored Ramsey number of even cycles Benevides, Fabricio Siqueira
2009
4 p. 690-708
19 p.
artikel
77 The dag-width of directed graphs Berwanger, Dietmar
2012
4 p. 900-923
24 p.
artikel
78 The maximum edit distance from hereditary graph properties Alon, Noga
2008
4 p. 672-697
26 p.
artikel
79 The nonorientable genus of complete tripartite graphs Ellingham, M.N.
2006
4 p. 529-559
31 p.
artikel
80 The Ramsey number for a triple of long even cycles Figaj, Agnieszka
2007
4 p. 584-596
13 p.
artikel
81 The uniform locally finite tilings of the plane Renault, D.
2008
4 p. 651-671
21 p.
artikel
82 The vertex primitive and vertex bi-primitive s-arc regular graphs Li, Cai Heng
2010
4 p. 359-366
8 p.
artikel
83 Triangle packings and 1-factors in oriented graphs Keevash, Peter
2009
4 p. 709-727
19 p.
artikel
84 Two-colorings with many monochromatic cliques in both colors Frankl, Peter
2013
4 p. 415-427
13 p.
artikel
                             84 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland