Results 131 to 140 of about 13,294,177 (308)

Independent sets and repeated degrees

open access: yesDiscrete Mathematics, 1997
\textit{P. Erdös}, \textit{S. Fajtlowicz} and \textit{W. Staton} [Discrete Math. 92, No. 1-3, 85-88 (1991; Zbl 0752.05028)] showed that every triangle-free graph of order \(n\) in which no degree is repeated more than twice is bipartite and thus has independence number at least \(n/2\). \textit{P. Erdös}, \textit{R. Faudree}, \textit{T. J.
Bollobás, B, Scott, A
openaire   +3 more sources

The Role of Chemotherapy in Pediatric Myoepithelial Carcinoma: A Systematic Review of the Literature

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Myoepithelial carcinoma (MEC) in pediatric patients is a rare and aggressive malignancy characterized by heterogeneous morphology and variable molecular features. The optimal role of chemotherapy remains unclear. We conducted a systematic review according to PRISMA 2020 guidelines to evaluate chemotherapy in pediatric and young‐adult patients ...
Marco Salvi   +7 more
wiley   +1 more source

On unique independent sets in graphs

open access: yesDiscrete Mathematics, 1994
For a nonnegative integer \(k\), a subset \(I\) of the vertex set \(V(G)\) of a simple graph \(G\) is said to be \(k\)-independent if \(I\) is independent and every independent subset \(I'\) of \(G\) with \(| I'| \geq | I|- (k- 1)\) is a subset of \(I\).
Werner Siemes, Jerzy Topp, Lutz Volkmann
openaire   +1 more source

Determining Parental Factors for Clinical Trial Attrition in Pediatric Acute Lymphoblastic Leukemia

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background/Objectives Despite high enrollment rates on Children's Oncology Group (COG) protocols, attrition after initial consent is challenging, introducing bias and prolonging trial completion. While adult oncology literature has identified predictors of withdrawal, little is known about caregiver decision‐making for child participation in ...
Kimberly L. Stathas   +3 more
wiley   +1 more source

Bounds on the Clique and the Independence Number for Certain Classes of Graphs

open access: yesMathematics
In this paper, we study the class of graphs Gm,n that have the same degree sequence as two disjoint cliques Km and Kn, as well as the class G¯m,n of the complements of such graphs.
Valentin E. Brimkov, Reneta P. Barneva
doaj   +1 more source

Nephrogenic Rests/Nephroblastomatosis in Patients With Unilateral Wilms Tumor Are Not Associated With an Increased Risk of Relapse: An Analysis of Patients Treated on the SIOP‐WT‐2001 Protocol in the SIOP‐UK‐CCLG and SIOP‐GPOH Studies (2001–2022)

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Introduction Nephrogenic rests (NRs) and nephroblastomatosis (NBM) are precursor lesions for development of Wilms tumor (WT). Their association with the risk of relapse has not been properly assessed, partly due to misunderstanding of their diagnostic criteria and terminology.
Gordan M. Vujanić   +5 more
wiley   +1 more source

Simplicial complexes defined on groups

open access: yesOpen Mathematics
This study makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group, which are preserved by automorphisms of the group, and in many
Cameron Peter J.
doaj   +1 more source

Change in Mental Health and Resilience in Childhood Cancer Survivors After Attending a Person‐Centred State‐of‐the‐Art Late Effects Clinic—on Behalf of the PanCareFollowUp Consortium

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Person‐centred follow‐up care based on evidence‐based clinical practice guidelines and providing individualised information should help to inform and reassure survivors about their medical and psychosocial situation and provide treatment and support where needed.
Gisela Michel   +36 more
wiley   +1 more source

Independent Detour Transversals in 3-Deficient Digraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2013
In 1982 Laborde, Payan and Xuong [Independent sets and longest directed paths in digraphs, in: Graphs and other combinatorial topics (Prague, 1982) 173-177 (Teubner-Texte Math., 59 1983)] conjectured that every digraph has an independent detour ...
van Aardt Susan   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy