Zobrazeno 1 - 10
of 3 556
pro vyhledávání: '"Schiermeyer A"'
Autor:
Barát, János, Cambie, Stijn, Hahn, Geňa, Mattiolo, Davide, Onderko, Alfréd, Schiermeyer, Ingo, Tuza, Zsolt
Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current state of the art and related bibliography) presented by participants of
Externí odkaz:
http://arxiv.org/abs/2411.10046
We present some considerations in connection with the paper arXiv:1004.2980 [hep-ph] and give a response to the criticism of the quasipotential approach in our relativistic quark model.
Comment: 3 pages
Comment: 3 pages
Externí odkaz:
http://arxiv.org/abs/1007.0141
The $3$-colourability problem is a well-known NP-complete problem and it remains NP-complete for $bull$-free graphs, where $bull$ is the graph consisting of $K_3$ with two pendant edges attached to two of its vertices. In this paper we study $3$-colo
Externí odkaz:
http://arxiv.org/abs/2404.12515
For two graphs $G,H$, the \emph{Ramsey number} $r(G,H)$ is the minimum integer $n$ such that any red/blue edge-coloring of $K_n$ contains either a red copy of $G$ or a blue copy of $H$. For two graphs $G,H$, the \emph{Gallai-Ramsey number} $\operator
Externí odkaz:
http://arxiv.org/abs/2401.08942
Autor:
Hanks, Patrick, Lenarčič, Simon
Publikováno v:
Dictionary of American Family Names, 2 ed., 2022.
In the last years, connection concepts such as rainbow connection and proper connection appeared in graph theory and obtained a lot of attention. In this paper, we investigate the loose edge-connection of graphs. A connected edge-coloured graph $G$ i
Externí odkaz:
http://arxiv.org/abs/2206.11604
Publikováno v:
In Applied Mathematics and Computation 15 October 2024 479
Publikováno v:
In Discrete Applied Mathematics 31 December 2024 359:34-44
Publikováno v:
In Applied Mathematics and Computation 1 December 2024 482