Results 81 to 90 of about 63,637 (247)
A Grid Theorem for Strong Immersions of Walls
Journal of Graph Theory, EarlyView.ABSTRACT We show that a graph contains a large wall as a strong immersion minor if and only if the graph does not admit a tree‐cut decomposition of small “width”, which is measured in terms of its adhesion and the path‐likeness of its torsos.
Reinhard Diestel +3 more
wiley +1 more source
Supervised chemical graph mining improves drug-induced liver injury prediction
iScience, 2023 Summary: Drug-induced liver injury (DILI) is the main cause of drug failure in clinical trials. The characterization of toxic compounds in terms of chemical structure is important because compounds can be metabolized to toxic substances in the liver ...
Sangsoo Lim +5 more
doaj
Journal of Graph Theory, EarlyView.ABSTRACT An inversion of a tournament T $T$ is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let inv k ( T ) ${\text{inv}}_{k}(T)$ be the minimum length of a sequence of inversions using sets of size at most k $k$ that result in the transitive tournament.
Raphael Yuster
wiley +1 more source
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, EarlyView.ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source
Induced subgraphs of given sizes
Discrete Mathematics, 1999 Abstract We say ( n , e ) → ( m , f ), an ( m, f ) subgraph is forced, if every n -vertex graph of size e has an m -vertex spanned subgraph with f edges. For example, as Turan proved, ( n , e )→( k ,( k 2 )) for e > t k − 1 ( n ) and (n,e) ↛( k 2 )) , otherwise.
Paul Erdős +3 more
openaire +2 more sources
On coloring digraphs with forbidden induced subgraphs
Journal of Graph Theory, 2022 AbstractWe prove a conjecture by Aboulker, Charbit, and Naserasr by showing that every oriented graph in which the out‐neighborhood of every vertex induces a transitive tournament can be partitioned into two acyclic induced subdigraphs. We prove multiple extensions of this result to larger classes of digraphs defined by a finite list of forbidden ...
openaire +3 more sources
A Dichotomy Theorem for Γ ${\rm{\Gamma }}$‐Switchable H $H$‐Colouring on m $m$‐Edge‐Coloured Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Let G $G$ be a graph in which each edge is assigned one of the colours 1,2,…,m $1,2,\ldots ,m$, and let Γ ${\rm{\Gamma }}$ be a subgroup of Sm ${S}_{m}$. The operation of switching at a vertex x $x$ of G $G$ with respect to an element π $\pi $ of Γ ${\rm{\Gamma }}$ permutes the colours of the edges incident with x $x$ according to π $\pi $. We
Richard Brewster +2 more
wiley +1 more source
Subgraph Queries by Context-free Grammars
Journal of Integrative Bioinformatics, 2008 We describe a method for querying vertex- and edge-labeled graphs using context-free grammars to specify the class of interesting paths. We introduce a novel problem, finding the connection subgraph induced by the set of matching paths between given two ...
Sevon Petteri, Eronen Lauri
doaj +1 more source
Spanning Plane Subgraphs of 1‐Plane Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A graph drawn on the plane is called 1‐plane if each edge is crossed at most once by another edge. In this paper, we show that every 4‐edge‐connected 1‐plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many 4‐connected 1‐plane graphs that have no 2‐connected spanning plane subgraphs.
Kenta Noguchi +2 more
wiley +1 more source