Download:
|
by Technical Reports
http://www.cs.elte.hu/egres/design/generated/../../tr/egres-03-08.ps.gz
Add To MetaCart
Abstract:
four-connected graphs
Citations
|
184
|
Combinatorial Problems and Exercises
– Lovász
- 1993
|
|
73
|
Augmenting Graphs to Meet Edge-Connectivity Requirements
– Frank
- 1992
|
|
46
|
A reduction method for edge-connectivity in graphs
– Mader
- 1978
|
|
16
|
Configurations in graphs of large minimum degree, connectivity or chromatic number
– Thomassen
- 1989
|
|
16
|
A theory of 3-connected graphs
– Tutte
- 1961
|
|
11
|
Nash-Williams, On orientations, connectivity and odd-vertex-pairings in finite graphs
– A
- 1960
|
|
8
|
Connectivity and network in: Handbook of Combinatorics (eds
– Frank
- 1995
|
|
6
|
On Steinitz's theorem concerning convex 3polytopes and some properties of planar graphs, in The many facets of graph theory, Lecture
– Barnette, Grunbaum
- 1969
|
|
5
|
Two-connected orientations of Eulerian graphs, EGRES
– Berg, Jordan
|
|
4
|
A mixed version of Menger's theorem
– Egawa, Kaneko, et al.
- 1991
|
|
4
|
On the existence of k edge-disjoint 2-connected spanning subgraphs, EGRES
– Jordán
|
|
2
|
On minimally (n; )-connected graphs
– Kaneko, Ota
- 2000
|
|
2
|
On vertices of degree n in minimally n-connected graphs and digraphs
– Mader
- 1996
|
