D. W. Barnette

From MaRDI portal
Person:581881

Available identifiers

zbMath Open barnette.david-wWikidataQ102179765 ScholiaQ102179765MaRDI QIDQ581881

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q48746072001-07-30Paper
Contractible circuits in \(3\)-connected graphs2000-11-02Paper
Paths and circuits in partially directed graphs2000-01-02Paper
Cycle covers of planar 2-edge-connected graphs1998-06-11Paper
Generating the centrally symmetric 3-polyhedral graphs1996-06-11Paper
2-connected spanning subgraphs of planar 3-connected graphs1995-03-20Paper
A short proof of the \(d\)-connectedness of \(d\)-polytopes1995-03-12Paper
On the noninterpolation of polyhedral maps1994-08-29Paper
A construction of 3-connected graphs1994-06-19Paper
A 2-manifold of genus 8 without the \(W_ v\)-property1993-08-17Paper
3-trees in polyhedral maps1993-06-29Paper
Closed 2-cell embeddings in the projective plane1993-06-29Paper
On valences of polyhedra1992-06-27Paper
Polyhedral embeddings in the projective plane1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39749581992-06-26Paper
Generating projective plane polyhedral maps1991-01-01Paper
Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane1990-01-01Paper
W\({}_ V\) paths on the torus1990-01-01Paper
All 2-manifolds have finitely many minimal triangulations1989-01-01Paper
Unique embeddings of simple projective plane polyhedral maps1989-01-01Paper
All orientable 2-manifolds have finitely many minimal triangulations1988-01-01Paper
An impediment to polyhedrality1988-01-01Paper
Decomposition theorems for the torus, projective plane and Klein bottle1988-01-01Paper
5-connected 3-polytopes are refinements of octahedra1987-01-01Paper
Two ``simple 3-spheres1987-01-01Paper
Generating closed 2-cell embeddings in the torus and the projective plane1987-01-01Paper
An Upper Bound Theorem for Polytope Pairs1986-01-01Paper
\(W_ v\) paths in the projective plane1986-01-01Paper
Preassigning the shape of projections of convex polytopes1986-01-01Paper
Every simple 3-polytype with 34 vertices is Hamiltonian1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36884081985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36891901985-01-01Paper
All triangulations of the projective plane are geometrically realizable in \(E^ 4\).1983-01-01Paper
Generating the triangulations of the projective plane1982-01-01Paper
Decompositions of homology manifolds and their graphs1982-01-01Paper
Nonconvex vertices of polyhedral 2-manifolds1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39521181982-01-01Paper
A family of neighborly polytopes1981-01-01Paper
An invertible non-polyhedral diagram1980-01-01Paper
Nonfacets for shellable spheres1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38567941979-01-01Paper
Manifolds with few vertices1977-01-01Paper
Generating the \(c^*5\)-connected graphs1977-01-01Paper
Hamiltonian circuits in simple 3-polytopes with up to 26 vertices1975-01-01Paper
Generalized combinatorial cells and facet splitting1975-01-01Paper
An upper bound for the diameter of a polytope1974-01-01Paper
The projection of the f-vectors of 4-polytopes onto the (E,S)-plane1974-01-01Paper
On generating planar graphs1974-01-01Paper
The triangulations of the 3-sphere with up to 8 vertices1973-01-01Paper
A proof of the lower bound conjecture for convex polytopes1973-01-01Paper
Graph theorems for manifolds1973-01-01Paper
Cu t numbers of convex polytopes1973-01-01Paper
Projections of f-vectors of four-polytopes1973-01-01Paper
Hamiltonian circuits in certain prisms1973-01-01Paper
Generating planar 4-connected graphs1973-01-01Paper
Inequalities for f-vectors of 4-polytopes1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56447081972-01-01Paper
The sum of the solid angles of a \(d\)-polytope1972-01-01Paper
The minimum number of vertices of a simple polytope1971-01-01Paper
Toroidal maps with prescribed types of vertices and faces1971-01-01Paper
The graphs of polytopes with involutory automorphisms1971-01-01Paper
Dense sets of polytopes in \(P^ 3\)1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56152871971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56560261971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56573161970-01-01Paper
Preassigning the shape of a face1970-01-01Paper
Projections of 3-polytopes1970-01-01Paper
Hamiltonian circuits on 3-polytopes1970-01-01Paper
A completely unambiguous 5-polyhedral graph1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55898661969-01-01Paper
Wv paths on 3-polytopes1969-01-01Paper
On p-vectors of 3-polytopes1969-01-01Paper
A simple 4-dimensional nonfacet1969-01-01Paper
A necessary condition for d-polyhedrality1967-01-01Paper
Trees in Polyhedral Graphs1966-01-01Paper

Research outcomes over time

This page was built for person: D. W. Barnette