nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices
|
Lal, Arbind Kumar |
|
2010 |
27 |
2 |
p. 215-229 |
artikel |
2 |
Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles
|
Billington, Elizabeth J. |
|
2010 |
27 |
2 |
p. 161-170 |
artikel |
3 |
A Note on Group Choosability of Graphs with Girth at least 4
|
Omidi, G. R. |
|
2010 |
27 |
2 |
p. 269-273 |
artikel |
4 |
Automorphic Decompositions of Graphs
|
Beeler, Robert A. |
|
2010 |
27 |
2 |
p. 149-160 |
artikel |
5 |
Cleaning with Brooms
|
Messinger, Margaret-Ellen |
|
2010 |
27 |
2 |
p. 251-267 |
artikel |
6 |
Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs
|
Chvátal, Vašek |
|
2010 |
27 |
2 |
p. 171-175 |
artikel |
7 |
Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7
|
Máčajová, Edita |
|
2010 |
27 |
2 |
p. 231-241 |
artikel |
8 |
Lower Bound of the Number of Maximum Genus Embeddings and Genus Embeddings of K12s+7
|
Han, Ren |
|
2010 |
27 |
2 |
p. 187-197 |
artikel |
9 |
On 2-Connected Spanning Subgraphs with Bounded Degree in K1,r-Free Graphs
|
Kužel, Roman |
|
2011 |
27 |
2 |
p. 199-206 |
artikel |
10 |
On 3-Edge-Connected Supereulerian Graphs
|
Lai, Hong-Jian |
|
2010 |
27 |
2 |
p. 207-214 |
artikel |
11 |
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree
|
Markström, Klas |
|
2010 |
27 |
2 |
p. 243-249 |
artikel |
12 |
Superconnected and Hyperconnected Small Degree Transitive Graphs
|
Tian, Yingzhi |
|
2010 |
27 |
2 |
p. 275-287 |
artikel |
13 |
The k-Restricted Edge Connectivity of Balanced Bipartite Graphs
|
Yuan, Jun |
|
2010 |
27 |
2 |
p. 289-303 |
artikel |
14 |
The Number of Independent Sets in a Graph with Small Maximum Degree
|
Galvin, David |
|
2010 |
27 |
2 |
p. 177-186 |
artikel |