default search action
Ars Mathematica Contemporanea, Volume 12
Volume 12, Number 1, 2017
- Dragan Marusic, Tomaz Pisanski:
Slovenian Discrete and Applied Mathematics Society.
- Simona Bonvicini, Tomaz Pisanski:
A novel characterization of cubic Hamiltonian graphs via the associated quartic graphs. 1-24 - Aleksandar Ilic, Marko Milosevic:
The parameters of Fibonacci and Lucas cubes. 25-29 - Dan Archdeacon, Drago Bokal, Tanja Gologranc:
A characterization of plane Gauss paragraphs. 31-36 - Karin Cvetko-Vah:
On skew Heyting algebras. 37-50 - Mihael Perman:
A decomposition for Markov processes at an independent exponential time. 51-65 - Bill Allombert, Jean-Paul Allouche, Michel Mendès France:
Euler's divergent series and an elementary model in Statistical Physics. 67-76 - Aleksandra Gorzkowska, Rafal Kalinowski, Monika Pilsniak:
The distinguishing index of the Cartesian product of finite graphs. 77-87 - Niranjan Balachandran, Sajith Padinhatteeri:
χD(G), |Aut(G)|, and a variant of the Motion Lemma. 89-109 - Reza Sharafdini, Mitsugu Hirasaka:
Coherent configurations over copies of association schemes of prime order. 111-126 - Ehsan Estaji, Juan Alberto Rodríguez-Velázquez:
The strong metric dimension of generalized Sierpiński graphs with pendant vertices. 127-134 - Yan Yang:
Remarks on the thickness of Kn, n, n. 135-144 - Jin-Xin Zhou, Jin Ho Kwak, Yan-Quan Feng, Zhen-Lin Wu:
Automorphism group of the balanced hypercube. 145-154 - Walter Klotz, Torsten Sander:
Uniquely colorable Cayley graphs. 155-165 - Irena M. Jovanovic:
Non-negative spectrum of a digraph. 167-182 - Richard H. Hammack, Gregory D. Smith:
Cycle bases of reduced powers of graphs. 183-203
- Drago Bokal, Bojan Mohar, Jozef Sirán:
Dan Archdeacon (11 May 1954 to 18 February 2015). - 7th PhD Summer School in Discrete Mathematics.
- Petra Šparl Award 2018: Call for nominations.
Volume 12, Number 2, 2017
- Dragan Marusic, Tomaz Pisanski:
ADAM, An Offspring Journal is Here!
- Chris D. Godsil, Karen Meagher:
An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings. 205-217 - Francesca Merola, Anita Pasotti, Marco Antonio Pellegrini:
Cyclic and symmetric hamiltonian cycle systems of the complete multipartite graph: even number of parts. 219-233 - Susana-Clara López, Francesc Antoni Muntaner-Batle:
Distance labelings: a generalization of Langford sequences. 235-245 - Hanlin Chen, Renfang Wu, Guihua Huang, Hanyuan Deng:
Independent sets on the Towers of Hanoi graphs. 247-260 - Damir Vukicevic, Riste Skrekovski, Aleksandra Tepeh:
Relative edge betweenness centrality. 261-270 - Mohammad Reza Oboudi:
Characterization of graphs with exactly two non-negative eigenvalues. 271-286 - Richard M. Green, Metod Saniga:
A classification of the Veldkamp lines of the near hexagon L3 × GQ(2, 2). 287-299 - Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Günter Rote, Gábor Wiener:
Search for the end of a path in the d-dimensional grid and in other graphs. 301-314 - Daniel Pellicer:
A chiral 4-polytope in R3. 315-327 - Zhao Dong, Wenbo V. Li, Chunwei Song:
Integral representations for binomial sums of chances of winning. 329-336 - Niko Tratnik, Petra Zigert Pletersek:
Saturation number of nanotubes. 337-350 - Mária Janicová, Tomás Madaras, Roman Soták, Borut Luzar:
From NMNR-coloring of hypergraphs to homogenous coloring of graphs. 351-360 - Jehan A. Al-bar, Ahmad N. Al-kenani, Najat M. Muthana, Cheryl E. Praeger:
A normal quotient analysis for some families of oriented four-valent graphs. 361-381 - Marston D. E. Conder, Tomaz Pisanski, Arjana Zitnik:
Vertex-transitive graphs and their arc-types. 383-413 - Kris Coolsaet:
Spherical quadrangles with three equal sides and rational angles. 415-424
- Petra Šparl Award 2018: Call for nominations.
- Slovenian Discrete and Applied Mathematics Society, Membership Application Form.
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.