Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-9
|
Results: 9
On factors of 4-connected claw-free graphs
Authors:
Broersma, HJ Kriesell, M Ryjacek, Z
Citation:
Hj. Broersma et al., On factors of 4-connected claw-free graphs, J GRAPH TH, 37(2), 2001, pp. 125-136
The symmetric (2k, k)-graphs
Authors:
Kriesell, M
Citation:
M. Kriesell, The symmetric (2k, k)-graphs, J GRAPH TH, 36(1), 2001, pp. 35-51
Induced paths in 5-connected graphs
Authors:
Kriesell, M
Citation:
M. Kriesell, Induced paths in 5-connected graphs, J GRAPH TH, 36(1), 2001, pp. 52-58
Almost all 3-connected graphs contain a contractible set of k vertices
Authors:
Kriesell, M
Citation:
M. Kriesell, Almost all 3-connected graphs contain a contractible set of k vertices, J COMB TH B, 83(2), 2001, pp. 305-319
All 4-connected line graphs of claw free graphs are hamiltonian connected
Authors:
Kriesell, M
Citation:
M. Kriesell, All 4-connected line graphs of claw free graphs are hamiltonian connected, J COMB TH B, 82(2), 2001, pp. 306-315
A degree sum condition for the existence of a contractible edge in a k-connected graph
Authors:
Kriesell, M
Citation:
M. Kriesell, A degree sum condition for the existence of a contractible edge in a k-connected graph, J COMB TH B, 82(1), 2001, pp. 81-101
Contractible subgraphs in 3-connected graphs
Authors:
Kriesell, M
Citation:
M. Kriesell, Contractible subgraphs in 3-connected graphs, J COMB TH B, 80(1), 2000, pp. 32-48
The k-critical 2k-connected graphs for k is an element of {3,4}
Authors:
Kriesell, M
Citation:
M. Kriesell, The k-critical 2k-connected graphs for k is an element of {3,4}, J COMB TH B, 78(1), 2000, pp. 69-80
On a conjecture of Thomassen and Toft
Authors:
Kriesell, M
Citation:
M. Kriesell, On a conjecture of Thomassen and Toft, J GRAPH TH, 32(2), 1999, pp. 118-122
Risultati:
1-9
|