Sciweavers

ENDM
2002
91views more  ENDM 2002»
13 years 10 months ago
On minimally 3-connected graphs on a surface
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
Katsuhiro Ota
JCT
2007
93views more  JCT 2007»
13 years 10 months ago
Generating bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that...
Serguei Norine, Robin Thomas
JCT
2006
102views more  JCT 2006»
13 years 10 months ago
Minimal bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletio...
Serguei Norine, Robin Thomas