885 citations
- University of Pavol Jozef ŠafárikSK297 papers
- Slovak Academy of SciencesSK267 papers
- HUN-REN Wigner Research Centre for PhysicsHU263 papers
- Hiroshima UniversityJP261 papers
- The University of TokyoJP261 papers
- University of BirminghamGB261 papers
- University of OsloNO261 papers
- Central China Normal UniversityCN260 papers
- Comenius University BratislavaSK260 papers
- Czech Academy of Sciences, Nuclear Physics InstituteCZ260 papers
- FZU ‒ Institute of Physics of the Academy of Sciences of the Czech RepublicCZ260 papers
- Heidelberg UniversityDE260 papers
8 papers · 1 filter
On local antimagic vertex coloring for complete full -ary trees
Martin Bača, Andrea Semaničová-Feňovčíková, Ruei-Ting Lai +1
Let be a finite simple undirected graph without components. A bijection is called a local antimagic labeling if for any…
New constructions for the -queens problem
Martin Bača, Susana-Clara López, Francesc-Antoni Muntaner-Batle +1
Let be a digraph, possibly with loops. A queen labeling of is a bijective function such that, for every pair of arcs in …
The Thue choice number versus the Thue chromatic number of graphs
Erika Škrabuľáková
We say that a vertex colouring of a graph is nonrepetitive if there is no positive integer and a path on vertices in such that the associa…
Three classes of 1-planar graphs
Július Czap, Peter Šugerek
A graph is called 1-planar if it can be drawn in the plane so that each of its edges is crossed by at most one other edge. In this paper we decompose the set of all 1-planar graphs…
Joins of 1-planar graphs
Július Czap, Dávid Hudák, Tomáš Madaras
A graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. In this paper, we study 1-planar graph joins. We prove that the joi…
Total Thue colourings of graphs
Jens Schreyer, Erika Škrabuľáková
A total colouring of a graph is a colouring of its vertices and edges such that no two adjacent vertices or edges have the same colour and moreover, no edge coloured has its en…