Results 81 to 90 of about 16,341,714 (282)
On strongly spanning k-edge-colorable subgraphs [PDF]
Opuscula Mathematica, 2017 A subgraph \(H\) of a multigraph \(G\) is called strongly spanning, if any vertex of \(G\) is not isolated in \(H\). \(H\) is called maximum \(k\)-edge-colorable, if \(H\) is proper \(k\)-edge-colorable and has the largest size.
Vahan V. Mkrtchyan, Gagik N. Vardanyan
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric intramedullary low‐grade gliomas (PIMLGGs) are rare neoplasms that present unique clinical and management challenges. Although surgery remains the primary tool for tissue diagnosis and decompression, complete gross‐total resection is frequently unfeasible due to the infiltrative nature of these lesions.
Olga M. Sergeenko +5 more
wiley +1 more source
Toughness and the existence of fractional k-factors of graphs
Discrete Mathematics, 2008 In this paper, the relationship between the toughness and the existence of fractional \(k\)-factor of an undirected graph is discussed. Firstly, the authors prove that \(G\) has a fractional perfect matching if toughness of a connected graph is at least 1.
Guizhen Liu, Lanju Zhang
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Adult survivors of childhood acute lymphoblastic leukemia (ALL) are at risk of reduced exercise capacity, decreased physical activity levels, persistent fatigue, and neurocognitive deficits. The aim was to investigate exercise capacity and physical activity levels of adult survivors of childhood ALL and their associations with ...
Laura Jess +5 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Young adult childhood cancer survivors (YA‐CCS) have an increased risk of treatment‐related health complications throughout their lives. Lifelong survivorship care is recommended, yet many YA‐CCS experience disruptions in care during pediatric‐to‐adult transitions and do not receive recommended survivorship care.
Kevin Shanchen Pu +8 more
wiley +1 more source
Maximum graphs with a unique k-factor
Journal of Combinatorial Theory, Series B, 1984 For suitable integers \(p\) and \(k\), let \(f(p,k)\) denote the maximum number of edges in a graph of order \(p\) which has a unique \(k\)-factor. The values of \(f(p,k)\) are determined for \(k=2\), \(p-3\) and \(p-2\) and the extremal graphs are determined.
openaire +2 more sources
Identifying Patterns of Hospitalizations Among Childhood Cancer Survivors: A Population‐Based Study
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Childhood cancer survivors (CCSs) experience more hospitalizations than the general population. We aimed to identify distinct hospitalization patterns among Queensland CCSs and the associated characteristics. Methods Cases (aged ≤14 years) diagnosed between 1995 and 2019 while residents of Queensland were identified through the ...
Hai Pham +7 more
wiley +1 more source
Strong Tutte Type Conditions and Factors of Graphs
Discussiones Mathematicae Graph Theory, 2020 Let odd(G) denote the number of odd components of a graph G and k ≥ 2 be an integer. We give sufficient conditions using odd(G − S) for a graph G to have an even factor.
Yan Zheng, Kano Mikio
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric refractory immune thrombocytopenia (rITP) is generally characterized by persistent thrombocytopenia and failure to achieve a sustained response to multiple standard therapies. We report a 4‐year‐old female with congenital tufting enteropathy, post‐intestinal transplant patient on immunosuppressants, who developed severe rITP ...
Sarah Hsieh +4 more
wiley +1 more source
Estimation of k-Factor Gigarch Process: A Monte Carlo Study
, 2008 International audienceIn this paper, we discuss the parameter estimation for a k-factor generalized long memory processwith conditionally heteroskedastic noise. Two estimation methods are proposed.
Guegan, Dominique +2 more
core +1 more source