Results 51 to 60 of about 453 (193)
Weak Degeneracy of Planar Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The weak degeneracy of a graph G $G$ is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for graph coloring. Every d $d$‐degenerate graph is weakly d $d$‐degenerate, but the converse is not true in general (e.g., all connected d $d$‐regular graphs except ...
Anton Bernshteyn +2 more
wiley +1 more source
A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs
Journal of Graph Theory, EarlyView.ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley +1 more source
, 2005 The class of doubly chordal graphs, which is a subclass of chordal graphs and a superclass of strongly chordal graphs, arises in many application areas.
Radhakrishnan, Sridhar, Lee, Mahnhoon
core +1 more source
Ordered and linked chordal graphs [PDF]
, 2008 A graph G is called k-ordered if for every sequence of k distinct vertices there is a cycle traversing these vertices in the given order. In the present paper we consider two novel generalizations of this concept, k-vertex-edge-ordered and strongly k ...
Stiebitz, Michael +2 more
core +1 more source
PLANTS, PEOPLE, PLANET, EarlyView.Arboreta bridge people and nature while conserving tree biodiversity, supporting climate resilience, and advancing environmental education. This study maps over a century of available and indexed arboretum research, uncovering trends, knowledge gaps, and opportunities for collaboration.
Catarina Patoilo Teixeira +1 more
wiley +1 more source
Dominating cliques in chordal graphs
, 1994 A chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal graph which has a dominating clique has one as small as the smallest dominating set—and, furthermore, there is a linear-time algorithm to find such a small ...
Damaschke, Peter +2 more
core +1 more source
On P 4 -transversals of Chordal Graphs [PDF]
, 2020 A P 4 -transversal of a graph G is a set of vertices T which meets every P 4 of G. A P 4 -transversal T is called stable if there are no edges in the subgraph of G induced by T .
Juraj Stacho
core
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs
, 2023 International audienceFor a graph G=(V,E) with a vertex set V and an edge set E, a function f:V→{0,1,2,...,diam(G)} is called a broadcast on G. For each vertex u∈V, if there exists a vertex v in G (possibly, u=v) such that f(v)>0 and d(u,v)≤f(v), then f ...
Islam, Sk Samim +3 more
core +1 more source
Phytotherapy Research, EarlyView.In vitro and in vivo effects of PTSO in colorectal cancer preclinical models, highlighting antiproliferative, pro‐apoptotic, barrier‐enhancing, antitumor, prebiotic and immunomodulatory properties. Created using BioRender. ABSTRACT Allium‐derived organosulfur compounds offer significant health benefits.
María Jesús Rodríguez‐Sojo +16 more
wiley +1 more source
Early use of the reinforced concrete in the architecture of the Historicism in Austria–Hungary
Structural Concrete, EarlyView.Abstract The study examines the early incorporation of reinforced concrete in the architecture of Historicism in Austria–Hungary. Spanning the late 19th to early 20th centuries, the research illuminates the period's stylistic pluralism and the transformative impact of reinforced concrete.
Éva Lovra, Zoltán Bereczki
wiley +1 more source