Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 337
Volume 337, December 2014
- Michael Follett, Kyle Kalail, Elizabeth W. McMahon
, Catherine Pelland, Robert J. Won:
Partitions of AG(4, 3) into maximal caps. 1-8 - Maciej Dziemianczuk:
Enumerations of plane trees with multiple edges and Raney lattice paths. 9-24 - Mariusz Grech:
Graphical cyclic permutation groups. 25-33 - Daniel Meister:
Clique-width with an inactive label. 34-64 - Hiroaki Taniguchi:
New dimensional dual hyperovals, which are not quotients of the classical dual hyperovals. 65-75 - Stephan Brandt, Jochen Harant, Steffi Naumann:
On degree sums of a triangle-free graph. 76-82 - Gábor Mészáros:
Note on the diameter of path-pairable graphs. 83-86 - Hengming Zhao, Dianhua Wu, Rongcun Qin:
Further results on balanced (n, {3, 4}, Λa, 1)-OOCs. 87-96 - Kostas Manes, Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras:
Nonleft peaks in Dyck paths: A combinatorial approach. 97-105 - Horst Martini, Christian Richter, Margarita Spirova:
Illuminating and covering convex bodies. 106-118 - Márcia R. Cerioli, Hugo Nobrega, Petrucio Viana:
Decomposition by maxclique separators. 119-126 - Filippo Disanto, Thomas Wiehe:
On the sub-permutations of pattern avoiding permutations. 127-141 - Tomas Gavenciak, Jan Kratochvíl, Pawel Pralat:
Firefighting on square, hexagonal, and triangular grids. 142-155
a service of 
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.
last updated on 2024-06-21 22:41 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:
