Results 81 to 90 of about 60,649 (158)

Graceful Tree Labelings

open access: yes, 2012
The Graceful Tree Conjecture was published almost 40 years ago and nowadays it is still an open problem. It seems as difficult to solve as it is to enunciate: every tree admits a vertex labeling on 0, 1, ..., n-1 such that the set of values of the differences of the numbers assigned to the ends of each edge is the set {1, 2, ..., n-1}.
openaire   +1 more source

A Note on Set Graceful Labeling of Graphs

open access: yes, 2011
We settle affirmatively a conjecture posed in [S. M. Hegde, Set colorings of graphs, European Journal of Combinatorics 30 (4) (2009), 986--995]: If some subsets of a set X are assigned injectively to all vertices of a complete bipartite graph G such that the collection of all sets, each of which is the symmetric difference of the sets assigned to the ...
openaire   +2 more sources

Radiomics-Guided Global-Local Transformer for Weakly Supervised Pathology Localization in Chest X-Rays. [PDF]

open access: yesIEEE Trans Med Imaging, 2023
Han Y   +5 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy