AOAlfréd Onderko
Alfréd Onderko
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Alfréd Onderko has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Tomáš Madaras
Institute of Mathematics, Košice, Slovakia
4 shared publications - Igor Grzelec
Department of Discrete Mathematics AGH University of Krakow Poland
3 shared publications Daniela Matisová
Pavol Jozef Safarik Univ Kosice, Kosice, Slovakia
1 shared publication- Mariusz Woźniak
AGH University of Science and Technology
1 shared publication - Roman Soták
Faculty of Science Pavol Jozef Šafárik University Košice Slovakia
1 shared publication - Stanislav Jendrol'
Institute of Mathematics, P. J. Šafárik University, Košice, Slovakia
1 shared publication
Latest Publications
- 20 November 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 514
On local irregularity conjecture for 2-multigraphs
- 20 November 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 514
On local irregularity conjecture for 2-multigraphs
- 10 October 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 512
On a new problem about the local irregularity of graphs
- 10 October 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 512
On a new problem about the local irregularity of graphs
- 27 February 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 368, 105-111
On edge colorings of graphs with no color-rich cycles
- 27 February 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 368, 105-111
On edge colorings of graphs with no color-rich cycles
- Open Access
- 26 February 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (2) , 1-8
A Note on the Facial Edge-Coloring Conjecture
Let G be a connected plane graph that can have loops and multiple edges. An l-facial edge-coloring of a plane graph G is a coloring of edges of G such that any two edges, that share the same facial trail of length at most $$l + 1$$ , receive distinct colors. It is an edge variant of the l-facial vertex coloring, which arose as a generalization of the well-known cyclic coloring. It was conjectured by Lužar et al. in 2015 that every plane graph admits an l-facial edge-coloring with at most $$3l + 1$$ colors for any $$l \ge 1$$ . It is known that the bound $$3l+1$$ is tight for general plane graphs. The conjecture was recently confirmed for $$l \le 3$$ by Horňák, Lužar and Štorgel (3-facial edge-coloring of plane graphs, Discrete Math. 346 (2023) 113312). In this note we prove that the conjecture holds, in the case when $$l \ge 4$$ , for every graph whose reduction (the graph obtained from G by suppressing all its 2-vertices) is 3-edge connected, and the length of the longest path in G with interior vertices of degree 2 is at most $$\frac{3l + 1}{10}$$ .- 26 February 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (2) , 1-8
Open AccessA Note on the Facial Edge-Coloring Conjecture
Let G be a connected plane graph that can have loops and multiple edges. An l-facial edge-coloring of a plane graph G is a coloring of edges of G such that any two edges, that share the same facial trail of length at most $$l + 1$$ , receive distinct colors. It is an edge variant of the l-facial vertex coloring, which arose as a generalization of the well-known cyclic coloring. It was conjectured by Lužar et al. in 2015 that every plane graph admits an l-facial edge-coloring with at most $$3l + 1$$ colors for any $$l \ge 1$$ . It is known that the bound $$3l+1$$ is tight for general plane graphs. The conjecture was recently confirmed for $$l \le 3$$ by Horňák, Lužar and Štorgel (3-facial edge-coloring of plane graphs, Discrete Math. 346 (2023) 113312). In this note we prove that the conjecture holds, in the case when $$l \ge 4$$ , for every graph whose reduction (the graph obtained from G by suppressing all its 2-vertices) is 3-edge connected, and the length of the longest path in G with interior vertices of degree 2 is at most $$\frac{3l + 1}{10}$$ . - 1 January 2025
- Published by AGH University Press in Opuscula Mathematica
- Vol. 45 (1) , 79-101
On uniqueness of packing of three copies of 2-factors
The packing of three copies of a graph \(G\) is the union of three edge-disjoint copies (with the same vertex set) of \(G\). In this paper, we completely solve the problem of the uniqueness of packing of three copies of 2-regular graphs. In particular, we show that \(C_3,C_4,C_5,C_6\) and \(2C_3\) have no packing of three copies, \(C_7,C_8,C_3 \cup C_4, C_4 \cup C_4, C_3 \cup C_5\) and \(3C_3\) have unique packing, and any other collection of cycles has at least two distinct packings.- 1 January 2025
- Published by AGH University Press in Opuscula Mathematica
- Vol. 45 (1) , 79-101
On uniqueness of packing of three copies of 2-factors
The packing of three copies of a graph \(G\) is the union of three edge-disjoint copies (with the same vertex set) of \(G\). In this paper, we completely solve the problem of the uniqueness of packing of three copies of 2-regular graphs. In particular, we show that \(C_3,C_4,C_5,C_6\) and \(2C_3\) have no packing of three copies, \(C_7,C_8,C_3 \cup C_4, C_4 \cup C_4, C_3 \cup C_5\) and \(3C_3\) have unique packing, and any other collection of cycles has at least two distinct packings.- 16 May 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 477
Proper interval vertex colorings of graphs
- 16 May 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 477
Proper interval vertex colorings of graphs
- 1 January 2022
- Published by AGH University Press in Opuscula Mathematica
- Vol. 42 (1) , 65-73
Edge homogeneous colorings
We explore four kinds of edge colorings defined by the requirement of equal number of colors appearing, in particular ways, around each vertex or each edge. We obtain the characterization of graphs colorable in such a way that the ends of each edge see (not regarding the edge color itself) \(q\) colors (resp. one end sees \(q\) colors and the color sets for both ends are the same), and a sufficient condition for 2-coloring a graph in a way that the ends of each edge see (with the omission of that edge color) altogether \(q\) colors. The relations of these colorings to \(M_q\)-colorings and role colorings are also discussed; we prove an interpolation theorem for the numbers of colors in edge coloring where all edges around each vertex have \(q\) colors.- 1 January 2022
- Published by AGH University Press in Opuscula Mathematica
- Vol. 42 (1) , 65-73
Edge homogeneous colorings
We explore four kinds of edge colorings defined by the requirement of equal number of colors appearing, in particular ways, around each vertex or each edge. We obtain the characterization of graphs colorable in such a way that the ends of each edge see (not regarding the edge color itself) \(q\) colors (resp. one end sees \(q\) colors and the color sets for both ends are the same), and a sufficient condition for 2-coloring a graph in a way that the ends of each edge see (with the omission of that edge color) altogether \(q\) colors. The relations of these colorings to \(M_q\)-colorings and role colorings are also discussed; we prove an interpolation theorem for the numbers of colors in edge coloring where all edges around each vertex have \(q\) colors.