Tomáš Madaras
Research Subjects
Tomáš Madaras has a total of 57 co-authors. Here are the top co-authors by number of shared publications:
- Alfréd Onderko
Institute of Mathematics, P. J. Šafárik University, Košice, Slovakia
4 shared publications - Roman Soták
Faculty of Science Pavol Jozef Šafárik University Košice Slovakia
4 shared publications - Jozef Strečka
Department of Theoretical Physics and Astrophysics, Faculty of Science, Pavol Jozef Šafárik University in Košice, Park Angelinum 9, 040 01 Košice, Slovakia
3 shared publications - Július Czap
Technical University of Košice, Faculty of Economics, Department of Applied Mathematics and Business Informatics, Němcovej 32, 040 01 Košice, Slovakia
3 shared publications - Katarína Karľová
Laboratoire de Physique Théorique et Modélisation
3 shared publications - Mária Šurimová
Pavol Jozef Safarik Univ, Srobarova 2, Kosice 04180, Slovakia
3 shared publications
Latest Publications
- Open Access
- 16 December 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 517
On anti-A-connectivity in plane graphs
- 16 December 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 517
Open AccessOn anti-A-connectivity in plane graphs
- 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
- 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 2023
- Published by Institute of Mathematics, Czech Academy of Sciences in Mathematica Bohemica
- Vol. 148 (1) , 105-115
HOMOGENEOUS COLOURINGS OF GRAPHS
A proper vertex k-colouring of a graph G is called l-homogeneous if the number of colours in the neigbourhood of each vertex of G equals l. We explore basic properties (the existence and the number of used colours) of homogeneous colourings of graphs in general as well as of some specific graph families, in particular planar graphs.
- 1 January 2023
- Published by Institute of Mathematics, Czech Academy of Sciences in Mathematica Bohemica
- Vol. 148 (1) , 105-115
HOMOGENEOUS COLOURINGS OF GRAPHS
A proper vertex k-colouring of a graph G is called l-homogeneous if the number of colours in the neigbourhood of each vertex of G equals l. We explore basic properties (the existence and the number of used colours) of homogeneous colourings of graphs in general as well as of some specific graph families, in particular planar graphs.
- 22 July 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 321, 308-315
On the structure of essentially-highly-connected polyhedral graphs
- 22 July 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 321, 308-315
On the structure of essentially-highly-connected polyhedral 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.- 19 December 2021
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (1) , 1-14
Facial Visibility in Edge Colored Plane Graphs
- 19 December 2021
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (1) , 1-14
Facial Visibility in Edge Colored Plane Graphs
- Open Access
Facial Homogeneous Colouring of Graphs
A proper colouring of a plane graph G is called facially homogeneous if it uses the same number of colours for every face of G. We study various sufficient conditions of facial homogeneous colourability of plane graphs, its relation to other facial colourings, and the extension of this concept for embedded graphs in general.
Open AccessFacial Homogeneous Colouring of Graphs
A proper colouring of a plane graph G is called facially homogeneous if it uses the same number of colours for every face of G. We study various sufficient conditions of facial homogeneous colourability of plane graphs, its relation to other facial colourings, and the extension of this concept for embedded graphs in general.
- 1 September 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 284, 224-233
Adynamic coloring of graphs
- 1 September 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 284, 224-233
Adynamic coloring of graphs