![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Ars Mathematica Contemporanea, Volume 4
Volume 4, Number 1, 2011
- Joan P. Hutchinson:
In memory of Michael O. Albertson, 1946-2009.
- Michael O. Albertson, János Pach, Michael E. Young:
Disjoint homometric sets in graphs. 1-4 - Michael O. Albertson, Debra L. Boutin, Ellen Gethner:
More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number. 5-24 - Xuding Zhu:
Graphs with chromatic numbers strictly less than their colouring numbers. 25-27 - Vittorio Addona, Stan Wagon, Herbert S. Wilf:
How to lose as little as possible. 29-62 - Marston D. E. Conder, Thomas W. Tucker:
Motion and distinguishing number two. 63-72 - Mu-Tsun Tsai, Douglas B. West:
A new proof of 3-colorability of Eulerian triangulations. 73-77 - André Kündgen, R. Bruce Richter:
On 2-factors with long cycles in cubic graphs. 79-93 - Alan Shuchat, Randy Shull, Ann N. Trenk:
The total weak discrepancy of a partially ordered set. 95-109 - Mark N. Ellingham, Justin Z. Schroeder:
Distinguishing partitions and asymmetric uniform hypergraphs. 111-123 - Kelly Choo, Gary MacGillivray:
Gray code numbers for graphs. 125-139 - Ileana Streinu, Louis Theran:
Natural realizations of sparsity matroids. 141-151 - Alexandr V. Kostochka, Christopher J. Stocker:
Graphs with maximum degree 5 are acyclically 7-colorable. 153-164 - Gasper Fijavz, Seiya Negami, Terukazu Sano:
3-Connected planar graphs are 5-distinguishing colorable with two exceptions. 165-175 - Hong Liu, Michael J. Pelsmajer:
Dominating sets in triangulations on surfaces. 177-204
Volume 4, Number 2, 2011
- Roman Nedela, Martin Skoviera:
GEMS 2009. - GEMS 2009 Pictures.
- Mikhail H. Klin, Christian Pech:
A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices. 205-243 - Dávid Hudák, Tomás Madaras:
On local properties of 1-planar graphs with high minimum degree. 245-254 - Július Czap, Stanislav Jendrol', Frantisek Kardos:
Facial parity edge colouring. 255-269 - Marston D. E. Conder, Thomas W. Tucker:
The symmetric genus spectrum of finite groups. 271-289 - Cristina Sarti:
Wada dessins associated with finite projective spaces and Frobenius compatibility. 291-311 - Gareth A. Jones:
Classification and Galois conjugacy of Hamming maps. 313-328 - István Kovács, Roman Nedela:
Decomposition of skew-morphisms of cyclic groups. 329-349 - Alexander D. Mednykh, Alain Giorgetti:
Enumeration of genus-four maps by number of edges. 351-361 - Ondrej Such:
Vertex transitive maps on the Klein bottle. 363-374 - Robert Jajcay, Jozef Sirán:
Small vertex-transitive graphs of given degree and girth. 375-384 - Alen Orbanic, Daniel Pellicer, Tomaz Pisanski, Thomas W. Tucker:
Edge-transitive maps of low genus. 385-402
- Conference and MAGMA Workshop "Symmetries of discrete objects".
- Computers in Scientific Discovery 6.
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.