default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBranko Grünbaum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j33]Nino Basic
, Jan Groselj, Branko Grünbaum, Tomaz Pisanski:
Splittable and unsplittable graphs and configurations. Ars Math. Contemp. 16(1): 1-17 (2019)- 2013
- [j32]Branko Grünbaum:
Simplicial arrangements revisited. Ars Math. Contemp. 6(2): 419-433 (2013) - 2012
- [j31]Branko Grünbaum:
Is Napoleon's Theorem Really Napoleon's Theorem? Am. Math. Mon. 119(6): 495-501 (2012) - 2011
- [j30]Branko Grünbaum, Jonathan Lenchner:
Omittable Planes. Electron. J. Comb. 18(1) (2011) - 2010
- [j29]Leah Wrenn Berman, Branko Grünbaum:
Deletion constructions of symmetric 4-configurations. Part I. Contributions Discret. Math. 5(1) (2010)
2000 – 2009
- 2009
- [j28]Branko Grünbaum:
A catalogue of simplicial arrangements in the real projective plane. Ars Math. Contemp. 2(1): 1-25 (2009) - [j27]Branko Grünbaum, Lajos Szilassi:
Geometric realizations of special toroidal complexes. Contributions Discret. Math. 4(1) (2009) - [j26]Steven B. Gillispie, Branko Grünbaum:
The {4, 5} Isogonal Sponges on the Cubic Lattice. Electron. J. Comb. 16(1) (2009) - [j25]Jürgen Bokowski, Branko Grünbaum, Lars Schewe:
Topological configurations (n4) exist for all n>=17. Eur. J. Comb. 30(8): 1778-1785 (2009) - [j24]Branko Grünbaum:
The Symmetries of Things by John H. Conway; Heidi Burgiel; Chaim Goodman-Strauss. Am. Math. Mon. 116(6): 555-562 (2009) - 2008
- [j23]Leah Wrenn Berman, Branko Grünbaum, Jonathan Lenchner:
Omittable lines. Ars Math. Contemp. 1(2): 206-222 (2008) - [j22]Branko Grünbaum:
Musings on an example of Danzer's. Eur. J. Comb. 29(8): 1910-1918 (2008) - 2007
- [j21]Branko Grünbaum:
Graphs of polyhedra; polyhedra as graphs. Discret. Math. 307(3-5): 445-463 (2007) - 2006
- [j20]Marko Boben, Branko Grünbaum, Tomaz Pisanski, Arjana Zitnik:
Small Triangle-Free Configurations of Points and Lines. Discret. Comput. Geom. 35(3): 405-427 (2006) - 2001
- [j19]H. S. M. Coxeter, Branko Grünbaum:
Face-Transitive Polyhedra with Rectangular Faces and Icosahedral Symmetry. Discret. Comput. Geom. 25(2): 163-172 (2001) - [j18]Branko Grünbaum, Geoffrey C. Shephard:
Isohedra with dart-shaped faces. Discret. Math. 241(1-3): 313-332 (2001) - [j17]Branko Grünbaum, Joseph Zaks:
Convexification of polygons by flips and by flipturns. Discret. Math. 241(1-3): 333-342 (2001) - 2000
- [j16]Branko Grünbaum:
Parallelogram-faced isohedra with edges in mirror-planes. Discret. Math. 221(1-3): 93-100 (2000)
1990 – 1999
- 1999
- [c2]Bette Bultena, Branko Grünbaum, Frank Ruskey:
Convex drawings of intersecting families of simple closed curves. CCCG 1999 - 1998
- [j15]Branko Grünbaum:
Realizations of Symmetric Maps by Symmetric Polyhedra. Discret. Comput. Geom. 20(1): 19-33 (1998) - 1997
- [j14]Branko Grünbaum:
Isogonal Prismatoids. Discret. Comput. Geom. 18(1): 13-52 (1997) - 1992
- [j13]Robert Ammann, Branko Grünbaum, Geoffrey C. Shephard:
Aperiodic Tiles. Discret. Comput. Geom. 8: 1-25 (1992) - 1990
- [c1]Jonathan Ashley, Branko Grünbaum, Geoffrey C. Shephard, Walter Stromquist:
Self-duality Groups and Ranks of Self-dualities. Applied Geometry And Discrete Mathematics 1990: 11-50
1980 – 1989
- 1988
- [j12]Branko Grünbaum:
The edge-density of 4-critical planar graphs. Comb. 8(1): 137-139 (1988) - 1987
- [j11]Branko Grünbaum, Geoffrey C. Shephard:
Edge-transitive planar graphs. J. Graph Theory 11(2): 141-155 (1987) - 1986
- [j10]Branko Grünbaum, Geoffrey C. Shephard:
An extension to the catalogue of isonemal fabrics. Discret. Math. 60: 155-192 (1986) - 1983
- [j9]Branko Grünbaum, Geoffrey C. Shephard:
The 2-homeotoxal tilings of the plane and the 2-sphere. J. Comb. Theory B 34(2): 113-150 (1983) - 1982
- [j8]Ludwig Danzer, Branko Grünbaum:
Intersection properties of boxes in Rd. Comb. 2(3): 237-246 (1982)
1970 – 1979
- 1977
- [j7]Branko Grünbaum, Geoffrey C. Shephard:
Perfect colorings of transitive tilings and patterns in the plane. Discret. Math. 20: 235-247 (1977) - 1976
- [j6]Branko Grünbaum, Geoffrey C. Shephard:
Incidence Numbers of Complexes and Polytopes. J. Comb. Theory A 21(3): 345-368 (1976) - 1974
- [j5]Branko Grünbaum, Joseph Zaks:
The existence of certain planar maps. Discret. Math. 10(1): 93-115 (1974) - [j4]Branko Grünbaum:
Vertices Missed by Longest Paths or Circuits. J. Comb. Theory A 17(1): 31-38 (1974) - [j3]Branko Grünbaum:
Matchings in polytopal graphs. Networks 4(2): 175-190 (1974) - 1973
- [j2]Branko Grünbaum:
Intersecting all edges of centrally symmetric polyhedra by planes. Discret. Math. 5(3): 241-246 (1973) - [j1]Branko Grünbaum, Hansjoachim Walther:
Shortness Exponents of Families of Graphs. J. Comb. Theory A 14(3): 364-385 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
