Zobrazeno 1 - 10
of 375
pro vyhledávání: '"Broersma Hajo"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 1, Pp 187-196 (2022)
A graph G is called Hamilton-connected if for every pair of distinct vertices {u, v} of G there exists a Hamilton path in G that connects u and v. A graph G is said to be t-tough if t·ω(G − X) ≤ |X| for all X ⊆ V (G) with ω(G − X) > 1. The
Externí odkaz:
https://doaj.org/article/04853a1d5e6e4b10bad263dd83c28c8c
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 2, Pp 559-587 (2021)
Let G be a 4-connected graph. We call an edge e of G removable if the following sequence of operations results in a 4-connected graph: delete e from G; if there are vertices with degree 3 in G− e, then for each (of the at most two) such vertex x, d
Externí odkaz:
https://doaj.org/article/2346abb95c0d456a99f80f82f10def10
We say that a graph $G$ on $n$ vertices is $\{H,F\}$-$o$-heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least $n$. Generalizing earlier sufficient forbidden subgraph conditions for
Externí odkaz:
http://arxiv.org/abs/2409.13491
Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs. Denote by $\ex^{\mathrm{conn}}_r(n,\mathcal{F})$ the maximum number of hyperedges in an $n$-vertex connected $r$-uniform hypergraph which contains no member of $\mathcal{F}$ as a subhypergraph
Externí odkaz:
http://arxiv.org/abs/2409.03323
An $r$-graph $H$ is a hypergraph consisting of a nonempty set of vertices $V$ and a collection of $r$-element subsets of $V$ we refer to as the edges of $H$. An $r$-graph $H$ is called linear if any two edges of $H$ intersect in at most one vertex. L
Externí odkaz:
http://arxiv.org/abs/2401.12339
We introduce learning augmented algorithms to the online graph coloring problem. Although the simple greedy algorithm FirstFit is known to perform poorly in the worst case, we are able to establish a relationship between the structure of any input gr
Externí odkaz:
http://arxiv.org/abs/2312.00601
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 4, Pp 915-929 (2016)
A graph G is said to be 1-tough if for every vertex cut S of G, the number of components of G − S does not exceed |S|. Being 1-tough is an obvious necessary condition for a graph to be hamiltonian, but it is not sufficient in general. We study the
Externí odkaz:
https://doaj.org/article/d0375a48f0474f1fb97fb44a55e46d6d
Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs, and let $H$ be an $r$-uniform hypergraph. Then $H$ is called $\mathcal{F}$-free if it does not contain any member of $\mathcal{F}$ as a subhypergraph. The Tur\'{a}n number of $\mathcal{F}$, de
Externí odkaz:
http://arxiv.org/abs/2306.12463
The $k$-th Laplacian spectral moment of a digraph $G$ is defined as $\sum_{i=1}^n \lambda_i^k$, where $\lambda_i$ are the eigenvalues of the Laplacian matrix of $G$ and $k$ is a nonnegative integer. For $k=2$, this invariant is better known as the La
Externí odkaz:
http://arxiv.org/abs/2305.06362
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 287-307 (2014)
A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices. Let G be a graph on n vertices. We say that an induced subgraph of G is o−1-heavy if it contains two nonadjacent vertices which satisfy an Ore-typ
Externí odkaz:
https://doaj.org/article/8a2b714b768147569667b7e7e4c1a5b1