Zobrazeno 1 - 10
of 856
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
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
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
A set of vertices $X\subseteq V$ in a simple graph $G(V,E)$ is irredundant (CO-irredundant) if each vertex $x\in X$ is either isolated in the induced subgraph $G[X]$ or else has a private neighbor $y\in V\setminus X$ ($y\in V$) that is adjacent to $x
Externí odkaz:
http://arxiv.org/abs/2109.07718
Publikováno v:
In Discrete Applied Mathematics 31 March 2024 346:248-262
Autor:
Brause, Christoph, Doan, Trung Duy, Holub, Přemysl, Kabela, Adam, Ryjáček, Zdeněk, Schiermeyer, Ingo, Vrána, Petr
For every graph $X$, we consider the class of all connected $\{K_{1,3}, X\}$-free graphs which are distinct from an odd cycle and have independence number at least $4$, and we show that all graphs in the class are perfect if and only if $X$ is an ind
Externí odkaz:
http://arxiv.org/abs/2102.08783