Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Graceful_labeling> ?p ?o }
Showing triples 1 to 65 of
65
with 100 triples 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 Alexander 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 wikiPageLength "5279".
- Graceful_labeling wikiPageOutDegree "28".
- Graceful_labeling wikiPageRevisionID "673608658".
- Graceful_labeling wikiPageWikiLink Absolute_difference.
- Graceful_labeling wikiPageWikiLink Anton_Kotzig.
- Graceful_labeling wikiPageWikiLink Butterfly_graph.
- Graceful_labeling wikiPageWikiLink Category:Conjectures.
- Graceful_labeling wikiPageWikiLink Category:Graph_theory_objects.
- Graceful_labeling wikiPageWikiLink Caterpillar_graph.
- Graceful_labeling wikiPageWikiLink Caterpillar_tree.
- Graceful_labeling wikiPageWikiLink Cycle_graph.
- Graceful_labeling wikiPageWikiLink Edge-graceful_labeling.
- Graceful_labeling wikiPageWikiLink Eulerian_graph.
- Graceful_labeling wikiPageWikiLink Eulerian_path.
- Graceful_labeling wikiPageWikiLink Gear_graph.
- Graceful_labeling wikiPageWikiLink Gerhard_Ringel.
- Graceful_labeling wikiPageWikiLink Graph_(mathematics).
- Graceful_labeling wikiPageWikiLink Graph_labeling.
- Graceful_labeling wikiPageWikiLink Graph_theory.
- Graceful_labeling wikiPageWikiLink Grid_graph.
- Graceful_labeling wikiPageWikiLink Helm_graph.
- Graceful_labeling wikiPageWikiLink Hypercube.
- Graceful_labeling wikiPageWikiLink Integer.
- Graceful_labeling wikiPageWikiLink Lattice_graph.
- Graceful_labeling wikiPageWikiLink List_of_conjectures.
- Graceful_labeling wikiPageWikiLink List_of_graphs.
- Graceful_labeling wikiPageWikiLink List_of_unsolved_problems_in_mathematics.
- Graceful_labeling wikiPageWikiLink Lobster_graph.
- Graceful_labeling wikiPageWikiLink Matching_(graph_theory).
- Graceful_labeling wikiPageWikiLink Path_graph.
- Graceful_labeling wikiPageWikiLink Pentagon.
- Graceful_labeling wikiPageWikiLink Perfect_matching.
- Graceful_labeling wikiPageWikiLink Simple_graph.
- Graceful_labeling wikiPageWikiLink Solomon_W._Golomb.
- Graceful_labeling wikiPageWikiLink Tree_(graph).
- Graceful_labeling wikiPageWikiLink Tree_(graph_theory).
- Graceful_labeling wikiPageWikiLink Unsolved_problems_in_mathematics.
- Graceful_labeling wikiPageWikiLink Wheel_graph.
- Graceful_labeling wikiPageWikiLink File:Graceful_labeling.svg.
- Graceful_labeling wikiPageWikiLinkText "Graceful labeling".
- Graceful_labeling wikiPageWikiLinkText "Ringel–Kotzig conjecture".
- Graceful_labeling wikiPageWikiLinkText "graceful labeling".
- Graceful_labeling wikiPageWikiLinkText "graceful".
- Graceful_labeling wikiPageWikiLinkText "non-graceful".
- Graceful_labeling hasPhotoCollection Graceful_labeling.
- Graceful_labeling subject Category:Conjectures.
- Graceful_labeling subject Category:Graph_theory_objects.
- Graceful_labeling type Conjecture.
- Graceful_labeling type Object.
- Graceful_labeling type Statement.
- Graceful_labeling type Statement.
- 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 sameAs Graziöse_Beschriftung.
- Graceful_labeling sameAs m.027s1_r.
- Graceful_labeling sameAs Đồ_thị_duyên_dáng.
- Graceful_labeling sameAs Q1386718.
- Graceful_labeling sameAs Q1386718.
- Graceful_labeling wasDerivedFrom Graceful_labeling?oldid=673608658.
- Graceful_labeling depiction Graceful_labeling.svg.
- Graceful_labeling isPrimaryTopicOf Graceful_labeling.