232 search results - page 33 / 47 » jct 2006 |
73
Voted
JCT
2006
14 years 9 months ago
2006
We define a bijection that transforms an alternating sign matrix A with one -1 into a pair (N, E) where N is a (so called) neutral alternating sign matrix (with one -1) and E is an...
JCT
2006
14 years 9 months ago
2006
We consider the class A of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between th...
JCT
2006
14 years 9 months ago
2006
Erdos posed the problem of finding conditions on a graph G that imply t(G) = b(G), where t(G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest nu...
JCT
2006
14 years 9 months ago
2006
We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (non-intersecting) s...
JCT
2006
14 years 9 months ago
2006
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...