


default search action
Ars Mathematica Contemporanea, Volume 25
Volume 25, Number 1, 2025
- Vedran Krcadinac, Mario-Osvin Pavcevic, Kristijan Tabak:
Cubes of symmetric designs. 1 - Yanan Hu, Xingzhi Zhan:
On the metric subgraphs of a graph. 1 - Florian Frick, Matt Superdock:
Vertex numbers of simplicial complexes with free abelian fundamental group. 1 - James Tuite, Elias John Thomas, S. V. Ullas Chandran:
On some extremal position problems for graphs. 1 - Xiongfeng Zhan, Lu Lu, Xueyi Huang:
Distance-regular Cayley graphs over Z_p^s \oplus Z_p. 1 - Xuanlong Ma, Alireza Doostabadi, Kaishun Wang:
Notes on the diameter of the complement of the power graph of a finite group. 1 - Marston Conder, Isabelle Steinmann:
Answers to questions about medial layer graphs of self-dual regular and chiral polytopes. 1 - Benjamin Braun, McCabe Olsen:
Ehrhart limits. 1 - Dimitri Leemans, Micael Toledo:
Faithful and thin non-polytopal maniplexes. 1 - Nemanja Poznanovic, Cheryl E. Praeger:
Basic tetravalent oriented graphs of independent-cycle type. 1
Volume 25, Number 2, 2025
- Akbar Davoodi, Ramin Javadi, Azam Kamranian, Ghaffar Raeisi:
On a conjecture of Erdős on size Ramsey number of star forests. 2 - Jonathan Ariel Barmak:
Regular and semi-regular representations of groups by posets. 2 - Michael A. Henning, Douglas F. Rall:
Indicated total domination game. 2 - István Kovács:
Edge-transitive core-free Nest graphs. 2 - Károly Bezdek, Zsolt Lángi:
On optimal λ-separable packings in the plane. 2 - Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza:
Perfect matching cuts partitioning a graph into complementary subgraphs. 2 - Nino Basic, Martin Knor, Riste Skrekovski:
On regular graphs with Šoltés vertices. 2 - Hanna Furmanczyk, Rita Zuazua:
Adjacent vertex distinguishing total coloring of corona product of graphs. 2 - Iren Darijani, Babak Miraftab, Dave Witte Morris:
Arc-disjoint hamiltonian paths in Cartesian products of directed cycles. 2 - Shuhei Tsujie, Ryo Uchiumi:
Upper embeddability of graphs and products of transpositions associated with edges. 2
Volume 25, Number 3, 2025
- Stefan Gyürki, Ivona Hrivová, Sona Pavlíková:
Super-symmetric maps from dihedral groups. 3 - Jose Maria P. Balmaceda, Dom Vito A. Briones:
Families of association schemes on triples from two-transitive groups. 3 - Aleksander Malnic, Boris Zgrablic:
Coverings of general digraphs. 3 - Gülnaz Boruzanli Ekinci, Csilla Bujtás:
Mutual-visibility problems in Kneser and Johnson graphs. 3 - Simon Brezovnik, Darja Rupnik Poklukar, Janez Zerovnik:
The 2-rainbow domination number of Cartesian product of cycles. 3 - Yueli Han, Lu Lu:
Minimal directed strongly regular Cayley graphs over generalized dicyclic groups. 3 - Ayush Basu, Andrzej Rucinski:
How far are ternary words from shuffle squares? 3 - Alessandra A. Pereira, Christiane Neme Campos:
The domination and independent domination numbers of some families of snarks. 3 - Marc Hellmuth, Sandhya Thekkumpadan Puthiyaveedu:
On a generalization of median graphs: k-median graphs. 3 - Matteo Cavaleri, Alfredo Donno, Stefano Spessato:
On the wreath product of signed and gain graphs and its spectrum. 3
Volume 25, Number 4, 2025
- Junyan Chen, Lei Chen, Michael Giudici, Jing Jian Li, Cheryl E. Praeger, Binzhou Xia:
Bounding s for vertex-primitive s-arc-transitive digraphs of alternating and symmetric groups. 4 - Anyuan Tian, Yaokun Wu:
Bollobás set pair inequalities for compositions. 4 - Ksenija Rozman, Primoz Sparl:
Tetravalent distance magic graphs of small order and an infinite family of examples. 4 - Ohr Kadrawi, Vadim E. Levit:
The independence polynomial of trees is not always log-concave starting from order 26. 4 - Bostjan Bresar, Tanja Dravec, María Gracia Cornet, Michael A. Henning:
k-Domination ivariants on Kneser graphs. 4

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.