David W. Barnette - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

1999

Paths and circuits in partially directed graphsDavid W. Barnette, Shelley Gillett. DM, 195(1-3):239-243, 1999. [doi]

1998

Contractible circuits in 3-connected graphsDavid W. Barnette. DM, 187(1-3):19-29, 1998. [doi]

1997

Cycle Covers of Planar 2-Edge-Connected GraphsDavid W. Barnette. gc, 13(4):315-323, 1997. [doi]

1996

Generating the centrally symmetric 3-polyhedral graphsDavid W. Barnette. gc, 12(1):139-147, 1996. [doi]

1995

A short proof of the d-connectedness of d-polytypesDavid W. Barnette. DM, 137(1-3):351-352, 1995. [doi]

1994

2-Connected Spanning Subgraphs of Planar 3-Connected GraphsDavid W. Barnette. JCT, 61(2):210-216, 1994. [doi]

On the noninterpolation of polyhedral mapsAdrian Riskin, David W. Barnette. DM, 131(1-3):211-219, 1994. [doi]

1991

Generating projective plane polyhedral mapsDavid W. Barnette. JCT, 51(2):277-291, 1991. [doi]

On valences of polyhedraDavid W. Barnette, Peter Gritzmann, Rainer Höhne. JCT, 58(2):279-300, 1991. [doi]

1990

Generating the 4-connected and strongly 4-connected triangulations on the torus and projective planeDavid W. Barnette. DM, 85(1):1-16, 1990. [doi]

W:::v::: Paths on the TorusDavid W. Barnette. dcg, 5:603-608, 1990.

The Minimal Projective Plane Polyhedral MapsDavid W. Barnette. dimacs 1991: 63-70

1988

An impediment to polyhedralityDavid W. Barnette. JCT, 48(2):259-265, 1988. [doi]

Decomposition theorems for the torus, projective plane and Klein bottleDavid W. Barnette. DM, 70(1):1-16, 1988. [doi]

1987

5-connected 3-polytopes are refinements of octahedraDavid W. Barnette. JCT, 42(2):250-254, 1987. [doi]

Two simple 3-spheresDavid W. Barnette. DM, 67(1):97-99, 1987. [doi]

Generating Closed 2-Cell Embeddings in the Torus and the Projective PlaneDavid W. Barnette. dcg, 2:233-247, 1987.

1986

Preassigning the shape of projections of convex polytopesDavid W. Barnette. JCT, 42(2):293-295, 1986. [doi]

Every simple 3-polytype with 34 vertices is HamiltonianDavid W. Barnette. DM, 62(1):1-20, 1986. [doi]

W::v:: paths in the projective planeDavid W. Barnette. DM, 62(2):127-131, 1986. [doi]

1982

Nonconvex vertices of polyhedral 2-manifoldsDavid W. Barnette. DM, 41(2):123-130, 1982. [doi]

Generating the triangulations of the projective planeDavid W. Barnette. JCT, 33(3):222-230, 1982. [doi]

1974

The projection of the f-vectors of 4-polytopes onto the (E, S)-planeDavid W. Barnette. DM, 10(2):201-216, 1974. [doi]

An upper bound for the diameter of a polytopeDavid W. Barnette. DM, 10(1):9-13, 1974. [doi]

On generating planar graphsDavid W. Barnette. DM, 7(3-4):199-208, 1974. [doi]

1973

Projections of f-Vectors of Four-PolytopesDavid W. Barnette, John R. Reay. JCT, 15(2):200-209, 1973.

The Triangulations of the 3-Sphere with up to 8 VerticesDavid W. Barnette. JCT, 14(1):37-52, 1973.

Hamiltonian circuits in certain prismsMoshe Rosenfeld, David W. Barnette. DM, 5(4):389-394, 1973. [doi]

Sign in or sign up to see more results.

runs on WebDSL