Results 81 to 90 of about 11,796 (253)
On b-perfect Chordal Graphs [PDF]
Graphs and Combinatorics, 2009 The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which the b-chromatic number is equal to the chromatic number for every induced subgraph.
Maffray, Frédéric, Mechebbek, Meriem
openaire +3 more sources
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
Journal of Graph Theory, EarlyView.ABSTRACT We continue the study of ( tw , ω ) $({\mathsf{tw}},\omega )$‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by ...
Claire Hilaire +2 more
wiley +1 more source
Toughness and hamiltonicity in $k$-trees [PDF]
, 2001 We consider toughness conditions that guarantee the existence of a hamiltonian cycle in $k$-trees, a subclass of the class of chordal graphs. By a result of Chen et al.\ 18-tough chordal graphs are hamiltonian, and by a result of Bauer et al.\ there ...
Broersma, H.J., Xiong, L., Yoshimoto, K.
core +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source
A new method for computing the vertex PI index with applications to special classes of graphs
AKCE International Journal of Graphs and CombinatoricsThe Padmakar-Ivan (PI) index of a graph G is given by [Formula: see text], where [Formula: see text] is the number of equidistant vertices for the edge e.
S. C. Manju +2 more
doaj +1 more source
The Hadwiger number, chordal graphs and -perfection
AKCE International Journal of Graphs and Combinatorics, 2017 A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms of the Hadwiger number and we also characterize the families of graphs ...
Christian Rubio-Montiel
doaj +1 more source
The feasibility principle in community ecology
Oikos, EarlyView.The structure and function of ecological communities emerge from interactions among populations within specific environmental contexts. Yet we still lack general principles that explain how communities assemble, which patterns we should expect, and when transitions occur across diverse settings.
Serguei Saavedra
wiley +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
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs [PDF]
, 2023 Juhi Chaudhary +3 more
openalex +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