Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Graceful_labeling> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Graceful_labeling abstract "In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers between 0 and m inclusive, such that no two vertices share a label, and such that each edge is uniquely identified by the positive, or absolute difference between its endpoints. A graph which admits a graceful labeling is called a graceful graph.The name "graceful labeling" is due to Solomon W. Golomb; this class of labelings was originally given the name β-labelings by Alex Rosa in a 1967 paper on graph labelings.A major unproven conjecture in graph theory is the Graceful Tree conjecture or Ringel–Kotzig conjecture, named after Gerhard Ringel and Anton Kotzig, which hypothesizes that all trees are graceful. The Ringel-Kotzig conjecture is also known as the "graceful labeling conjecture". Kotzig once called the effort to prove the conjecture a "disease".".
- Graceful_labeling thumbnail Graceful_labeling.svg?width=300.
- Graceful_labeling wikiPageExternalLink Graceful%20Graphs-Final%20Edition-89-12-15.pdf.
- Graceful_labeling wikiPageID "8978968".
- Graceful_labeling wikiPageRevisionID "601545470".
- Graceful_labeling hasPhotoCollection Graceful_labeling.
- Graceful_labeling subject Category:Conjectures.
- Graceful_labeling subject Category:Graph_theory_objects.
- Graceful_labeling type Abstraction100002137.
- Graceful_labeling type Cognition100023271.
- Graceful_labeling type Concept105835747.
- Graceful_labeling type Conjectures.
- Graceful_labeling type Content105809192.
- Graceful_labeling type Hypothesis105888929.
- Graceful_labeling type Idea105833840.
- Graceful_labeling type PsychologicalFeature100023100.
- Graceful_labeling type Speculation105891783.
- Graceful_labeling comment "In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers between 0 and m inclusive, such that no two vertices share a label, and such that each edge is uniquely identified by the positive, or absolute difference between its endpoints. A graph which admits a graceful labeling is called a graceful graph.The name "graceful labeling" is due to Solomon W.".
- Graceful_labeling label "Graceful labeling".
- Graceful_labeling label "Graziöse Beschriftung".
- Graceful_labeling sameAs Graziöse_Beschriftung.
- Graceful_labeling sameAs m.027s1_r.
- Graceful_labeling sameAs Q1386718.
- Graceful_labeling sameAs Q1386718.
- Graceful_labeling sameAs Graceful_labeling.
- Graceful_labeling wasDerivedFrom Graceful_labeling?oldid=601545470.
- Graceful_labeling depiction Graceful_labeling.svg.
- Graceful_labeling isPrimaryTopicOf Graceful_labeling.