Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Thomas Schweser"'
Publikováno v:
Opuscula Mathematica, Vol 42, Iss 1, Pp 65-73 (2022)
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 s
Externí odkaz:
https://doaj.org/article/5edef51b7cbf4361bc9e2938e74aca4b
Autor:
Thomas Schweser, Michael Stiebitz
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 1, Pp 1-9 (2021)
In 2007 Matamala proved that if G is a simple graph with maximum degree Δ ≥ 3 not containing KΔ+1 as a subgraph and s, t are positive integers such that s+t ≥ Δ, then the vertex set of G admits a partition (S,T) such that G[S] is a maximum ord
Externí odkaz:
https://doaj.org/article/46725bdf54fc48fe9e6d0ef6fe4c552d
Publikováno v:
SIAM Journal on Discrete Mathematics. 36:578-595
Let $D$ be a digraph, let $p \geq 1$ be an integer, and let $f: V(D) \to \mathbb{N}_0^p$ be a vector function with $f=(f_1,f_2,\ldots,f_p)$. We say that $D$ has an $f$-partition if there is a partition $(D_1,D_2,\ldots,D_p)$ into induced subdigraphs
Autor:
Thomas Schweser
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 1, Pp 103-121 (2021)
A smooth hypergraph property $\mathcal{P}$ is a class of hypergraphs that is hereditary and non-trivial, i.e., closed under induced subhypergraphs and it contains a non-empty hypergraph but not all hypergraphs. In this paper we examine $\mathcal{P}$-
Publikováno v:
Graphs and Combinatorics. 38
Graphs considered in this paper are finite, undirected and without loops, but with multiple edges. For an integer $t\geq 1$, denote by $\mathcal{MG}_t$ the class of graphs whose maximum multiplicity is at most $t$. A graph $G$ is called strictly $t$-
Autor:
Thomas Schweser, Michael Stiebitz
Publikováno v:
Discrete Applied Mathematics. 257:269-275
In 1996, Michael Stiebitz proved that if G is a simple graph with δ ( G ) ≥ s + t + 1 and s , t ∈ Z 0 , then V ( G ) can be partitioned into two sets A and B such that δ ( G [ A ] ) ≥ s and δ ( G [ B ] ) ≥ t . In 2016, Amir Ban proved a si
Brooks'Theorem (1941) is one of the most famous and fundamental theorems in graph theory – it is mentioned/treated in all general monographs on graph theory. It has sparked research in several directions. This book presents a comprehensive overview
Publikováno v:
Bang-Jensen, J, Bellitto, T, Schweser, T & Stiebitz, M 2020, ' Hajós and ore constructions for digraphs ', Electronic Journal of Combinatorics, vol. 27, no. 1, P1.63 . https://doi.org/10.37236/8942
The dichromatic number $\overrightarrow{\chi}(D)$ of a digraph $D$ is the minimum number of colors needed to color the vertices of $D$ such that each color class induces an acyclic subdigraph of $D$. A digraph $D$ is $k$-critical if $\overrightarrow{
Autor:
Michael Stiebitz, Thomas Schweser
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 1, Pp 1-9 (2021)
In 2007 Matamala proved that if $G$ is a simple graph with maximum degree $\Delta\geq 3$ not containing $K_{\Delta +1}$ as a subgraph and $s, t$ are positive integers such that $s+t \geq \Delta$, then the vertex set of $G$ admits a partition $(S,T)$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46efc63c66301ac18f81faa79548a9df
Autor:
Michael Stiebitz, Thomas Schweser
The paper deals with partitions of hypergraphs into induced subhypergraphs satisfying constraints on their degeneracy. Our hypergraphs may have multiple edges, but no loops. Given a hypergraph $H$ and a sequence $f=(f_1,f_2, \ldots, f_p)$ of $p\geq 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::771877b4a5366faf6c44ea1578591beb