Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Madaras, Tomáš"'
A graph/multigraph $G$ is locally irregular if endvertices of every its edge possess different degrees. The locally irregular edge coloring of $G$ is its edge coloring with the property that every color induces a locally irregular sub(multi)graph of
Externí odkaz:
http://arxiv.org/abs/2405.13893
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, w
Externí odkaz:
http://arxiv.org/abs/2403.11721
Publikováno v:
In Applied Mathematics and Computation 15 September 2024 477
Autor:
Fabrici, Igor, Harant, Jochen, Madaras, Tomáš, Mohr, Samuel, Soták, Roman, Zamfirescu, Carol T.
Publikováno v:
Journal of Graph Theory 2020
A graph is $1$-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges induce a com
Externí odkaz:
http://arxiv.org/abs/1912.08028
Publikováno v:
Physica B 488 (2016) 49-56
The specific heat of regular Ising polyhedra is investigated in detail as a function of temperature and magnetic field. It is shown that the regular Ising polyhedra display diverse double-peak temperature dependences of the specific heat whenever the
Externí odkaz:
http://arxiv.org/abs/1512.05112
Publikováno v:
In Applied Mathematics and Computation 1 March 2021 392
Publikováno v:
Physica B 466-467 (2015) 76-85
Magnetization process and adiabatic demagnetization of the antiferromagnetic Ising spin clusters with the shape of regular polyhedra (Platonic solids) are exactly examined within the framework of a simple graph-theoretical approach. While the Ising c
Externí odkaz:
http://arxiv.org/abs/1502.04449
Autor:
Madaras Tomáš, Široczki Pavol
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 1, Pp 65-73 (2021)
A graph G is minimal non-unit-distance graph if there is no drawing of G in Euclidean plane having all edges of unit length, but, for each edge e of G, G − e has such a drawing. We prove that, for infinitely many n, the number of non-isomorphic n-v
Externí odkaz:
https://doaj.org/article/07ddf0e6648547dc80ccccc12c84983d
Publikováno v:
In Discrete Applied Mathematics 30 September 2020 284:224-233
Publikováno v:
Acta. Math. Sin.-English Ser. 30 (2014) 1867-1876
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 join $G+H$ is 1-planar if and only if the pair $[G,H]$ is subgraph-majori
Externí odkaz:
http://arxiv.org/abs/1403.6705