nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Characterization of Graphs without Even Factors
|
Li, Xueliang |
|
2006 |
22 |
4 |
p. 497-502 |
artikel |
2 |
A Degree Constraint for Uniquely Hamiltonian Graphs
|
Abbasi, Sarmad |
|
2006 |
22 |
4 |
p. 433-442 |
artikel |
3 |
Almost Symmetric Cycles in Large Digraphs
|
Adamus, Lech |
|
2006 |
22 |
4 |
p. 443-452 |
artikel |
4 |
Alternating Paths along Axis-Parallel Segments
|
Tóth, Csaba D. |
|
2006 |
22 |
4 |
p. 527-543 |
artikel |
5 |
-Decompositions of and Dv∪P where P is a 2-Regular Subgraph of Dv
|
Pu, Liqun |
|
2006 |
22 |
4 |
p. 515-525 |
artikel |
6 |
Kite-group Divisible Designs of Type gtu1
|
Wang, Haiyan |
|
2006 |
22 |
4 |
p. 545-571 |
artikel |
7 |
Largest Non-Unique Subgraphs
|
Andersen, Lars Døvling |
|
2006 |
22 |
4 |
p. 453-470 |
artikel |
8 |
On the Circuit-cocircuit Intersection Conjecture
|
Kingan, S. R. |
|
2006 |
22 |
4 |
p. 471-480 |
artikel |
9 |
Optimal t-Edge-Robust r-Identifying Codes in the King Lattice
|
Laihonen, Tero |
|
2006 |
22 |
4 |
p. 487-496 |
artikel |
10 |
Sizes of Critical Graphs with Small Maximum Degrees
|
Li, Xuechao |
|
2006 |
22 |
4 |
p. 503-513 |
artikel |
11 |
There Exist Highly Critically Connected Graphs of Diameter Three
|
Kriesell, Matthias |
|
2006 |
22 |
4 |
p. 481-485 |
artikel |