Vol. 6 No. 2 (2023)

Editorial

Preface to the Wilfried Imrich Issue on the Occasion of his 80th birthday

Tanja Dravec , Marko Jakovac, Sandi Klavžar, Iztok Peterin, Janez Žerovnik
- PDF

Laudationes

For Wilfried Imrich's 80th Birthday

Sandi Klavžar
- PDF

The Wilfried Imrich Issue of ADAM

Hierarchical and modularly-minimal vertex colorings

Dulce I. Valdivia, Maribel Hernández Rosales, Manuela Geiß, Peter F Stadler, Marc Hellmuth

#P2.01, 22 pp.
- PDF
- ABSTRACTS (EN/SI)
Construction of k-matchings in graph products

Anna Lindeberg, Marc Hellmuth

#P2.02, 36 pp.
- PDF
- ABSTRACTS (EN/SI)
Paint cost and the frugal distinguishing number

Debra L. Boutin

#P2.03, 13 pp.
- PDF
- ABSTRACTS (EN/SI)
Distinguishing arc-colourings of symmetric digraphs

Rafał Kalinowski, Monika Pilśniak, Magdalena Prorok

#P2.04, 14 pp.
- PDF
- ABSTRACTS (EN/SI)
Some properties of the factors of Fermat numbers

Lorenzo Sauras Altuzarra

#P2.05, 7 pp.
- PDF
- ABSTRACTS (EN/SI)
Symmetry parameters of various hypercube families

Debra Boutin, Sally Cockburn, Lauren Keough, Sarah Loeb, Puck Rombach

#P2.06, 25 pp.
- PDF
- ABSTRACTS (EN/SI)
Mycielskian of graphs with small game domination number

Tijo James, Ambat Vijayakumar

#P2.07, 12 pp.
- PDF
- ABSTRACTS (EN/SI)
Number of colors needed to break symmetries of a graph by an arbitrary edge coloring

Saeid Alikhani, Mohammad Hadi Shekarriz

#P2.08, 13 pp.
- PDF
- ABSTRACTS (EN/SI)
Composition and product of cover-incomparability graphs

Manoj Changat, Arun Anil

#P2.09, 11 pp.
- PDF
- ABSTRACTS (EN/SI)
The GFR problem and a theorem of Godsil

Marston D. E. Conder, Thomas William Tucker

#P2.10, 10 pp.
- PDF
- ABSTRACTS (EN/SI)
Subgraphs of Kneser graphs with large girth and large chromatic number

Bojan Mohar, Hehui Wu

#P2.11, 7 pp.
- PDF
- ABSTRACTS (EN/SI)
Lexicographic palindromic products

Jamie Shive

#P2.12, 12 pp.
- PDF
- ABSTRACTS (EN/SI)
Distance formula for direct-co-direct product in the case of disconnected factors

Aleksander Kelenc, Iztok Peterin

#P2.13, 21 pp.
- PDF
- ABSTRACTS (EN/SI)
Note on strong product graph dimension

Jaroslav Nešetřil, Aleš Pultr

#P2.14, 12 pp.
- PDF
- ABSTRACTS (EN/SI)
Working with Wilfried

Mark E. Watkins

#P2.15, 17 pp.
- PDF
- ABSTRACTS (EN/SI)

Editorial

Preface to the Wilfried Imrich Issue on the Occasion of his 80th birthday

Laudationes

For Wilfried Imrich's 80th Birthday

The Wilfried Imrich Issue of ADAM

Hierarchical and modularly-minimal vertex colorings

Construction of k-matchings in graph products

Paint cost and the frugal distinguishing number

Distinguishing arc-colourings of symmetric digraphs

Some properties of the factors of Fermat numbers

Symmetry parameters of various hypercube families

Mycielskian of graphs with small game domination number

Number of colors needed to break symmetries of a graph by an arbitrary edge coloring

Composition and product of cover-incomparability graphs

The GFR problem and a theorem of Godsil

Subgraphs of Kneser graphs with large girth and large chromatic number

Lexicographic palindromic products

Distance formula for direct-co-direct product in the case of disconnected factors

Note on strong product graph dimension

Working with Wilfried

Developed By

Information