Results 51 to 60 of about 142,988 (312)
On hereditary Helly classes of graphs [PDF]
Graphs and Algorithms In graph theory, the Helly property has been applied to families of sets, such as cliques, disks, bicliques, and neighbourhoods, leading to the classes of clique-Helly, disk-Helly, biclique-Helly, neighbourhood-Helly graphs, respectively.
Marina Groshaus, Jayme L. Szwarcfiter
openaire +4 more sources
Indivisibility for classes of graphs
We examine indivisibility for classes of graphs. We show that the class of hereditarily $α$-sparse graphs is indivisible if and only if $α> 2$. Additionally, we show that the following classes of graphs are indivisible: perfect graphs, cographs, and chordal graphs, and the following classes of graphs are not indivisible: threshold graphs, split ...
Vincent Guingona +5 more
openaire +2 more sources
On Ultralimits of Sparse Graph Classes
The notion of nowhere denseness is one of the central concepts of the recently developed theory of sparse graphs. We study the properties of nowhere dense graph classes by investigating appropriate limit objects defined using the ultraproduct construction.
Michal Pilipczuk, Szymon Torunczyk
openaire +3 more sources
The n-th Power Signed Graphs-II [PDF]
For standard terminology and notion in graph theory we refer the reader to Harary [6]; the non-standard will be given in this paper as and when required.
Reddyy, P. Siva Kota +2 more
core +1 more source
The Firefighter problem on graph classes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fedor V. Fomin +2 more
openaire +2 more sources
ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley +1 more source
On first-order transductions of classes of graphs [PDF]
We study various aspects of the first-order transduction quasi-order on graph classes, which provides a way of measuring the relative complexity of graph classes based on whether one can encode the other using a formula of first-order (FO) logic.
Samuel Braunfeld +3 more
doaj +1 more source
Generalisasi Bilangan Kromatik Pada Beberapa Kelas Graf Korona
For example is a chromatic number with the smallest integer so that the graph has a true vertex coloring with k color. Chromatic number is still an interesting study which is still being studied for its development through graph coloring.
Riduan Yusuf +3 more
doaj +1 more source
A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho +7 more
wiley +1 more source
On the Regular Power Graph on the Conjugacy Classes of Finite Groups [PDF]
The (undirected) power graph on the conjugacy classes PC(G) of a group G is a simple graph in which the vertices are the conjugacy classes of G and two distinct vertices C and C' are adjacent in PC(G) if one is a subset of a power of the other.
Sajjad Mahmood Robati
doaj +1 more source

