Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

This study investigated differences between attributional style and student adaptation to college for students with and without… Expand

2008

2008

Given a graph G, one can define a matroid M=(E,C) on the edges E of G with circuits C where C is either the cycles of G or the… Expand

2005

2005

We prove that a connected cographic matroid of a graph G is the bias matroid of a signed graph @S iff G imbeds in the projective… Expand

Highly Cited

2005

Highly Cited

2005

The causes of perinatal lamb mortality were studied, from March 2002 to October 2004, on 27 farms in the semiarid region of… Expand

2003

2003

A list of aquatic and semi aquatic Heteroptera species from Retiro das Pedras (Brumadinho, Minas Gerais), the community… Expand

2002

2002

The bicircular matroid B(G) of a graph G is known to be a transversal matroid. There are, in general, many graphs that represent… Expand

1997

1997

Les caracteres morphometriques de 22 populations attribuees a X. belmontense Roca & Pereira, 1992 et X. dissimile Roca, Pereira… Expand

1993

1993

Abstract This paper presents a polynomial-time algorithm for solving a restricted version of the recognition problem for… Expand

Highly Cited

1991

Highly Cited

1991

A biased graph Ω consists of a graph Γ and a class B of circles (simple, closed paths) in Γ, called balanced circles, such that… Expand

Highly Cited

1990

Highly Cited

1990

Abstract This paper describes evidence for the intergenerational transmission of one aspect of maternal style, rejection rates… Expand