The Wikipedia article on Ringel-Kotzig conjecture, consulted for its lead-section facts.
Facts
Citation
PublisherWikimedia Foundation
URLhttps://en.wikipedia.org/wiki/Ringel-Kotzig_conjecture
Source TypeReference Work
Assessment
Reliability Tier2
General encyclopedia reference, actively edited; tier 2 matching the family's existing Wikipedia source entities. Sources
Ringel-Kotzig Conjecture (Wikipedia)
Wikimedia FoundationLead sectionQuote, Lead section
In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers from 0 to m inclusive, such that no two vertices share a label, and each edge is uniquely identified by the absolute difference between its endpoints, such that this magnitude lies between 1 and m inclusive.
Claims Backed By This Source (6 claims)
This source backs 6 claims across the atlas. As facts: 5 well-attested. Plus 1 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Sources, 4 claims: 4 well-attested.
- Conjectures, 2 claims: 1 well-attested, 1 general references.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.