EJC 2007 | Sciweavers

28

EJC
2007

147views Information Technology» more EJC 2007»

The structure of the 3-separations of 3-connected matroids II

13 years 10 months ago

The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalence, all non-trivial 3-separations of a 3-connected matroid. The purpose of this ...

James G. Oxley, Charles Semple, Geoff Whittle

claim paper

Read More »

34

click to vote

EJC
2007

155views Information Technology» more EJC 2007»

Geometric and algebraic combinatorics

13 years 10 months ago

Download www.feb.uvt.nl

Edwin R. van Dam, Willem H. Haemers

claim paper

Read More »

28

click to vote

EJC
2000

115views Information Technology» more EJC 2000»

Cohomological Constructions of Regular Cyclic Coverings of the Platonic Maps

13 years 10 months ago

Download www.math.ksu.edu

David B. Surowski, Gareth A. Jones

claim paper

Read More »

38

click to vote

EJC
2000

99views Information Technology» more EJC 2000»

The Generalized Baues Problem for Cyclic Polytopes I

13 years 10 months ago

Download users.uoa.gr

Given an affine surjection of polytopes : P Q, the Generalized Baues Problem asks whether the poset of all proper polyhedral subdivisions of Q which are induced by the map has t...

Jörg Rambau, Francisco Santos

claim paper

Read More »

25

click to vote

EJC
2000

92views Information Technology» more EJC 2000»

On the Structure of 3-connected Matroids and Graphs

13 years 10 months ago

Download www.math.lsu.edu

James G. Oxley, Haidong Wu

claim paper

Read More »

31

click to vote

EJC
2000

105views Information Technology» more EJC 2000»

Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples

13 years 10 months ago

Download www.math.ntu.edu.tw

Lingling Huang, Gerard J. Chang

claim paper

Read More »

33

click to vote

EJC
2000

75views Information Technology» more EJC 2000»

Simple 0/1-Polytopes

13 years 10 months ago

Download www.iasi.cnr.it

For general polytopes, it has turned out that with respect to many questions it su ces to consider only the simple polytopes, i.e., d-dimensional polytopes where every vertex is c...

Volker Kaibel, Martin Wolff

claim paper

Read More »

23

click to vote

EJC
2000

102views Information Technology» more EJC 2000»

Further Investigations Involving Rook Polynomials With Only Real Zeros

13 years 10 months ago

Download www.math.upenn.edu

We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...

James Haglund

claim paper

Read More »

28

click to vote

EJC
2000

99views Information Technology» more EJC 2000»

On the Maximal Width of Empty Lattice Simplices

13 years 10 months ago