In combinatorial mathematics, LCF notation or LCF code is a notation devised by Joshua Lederberg, and extended by H. S. M. Coxeter and Robert Frucht, for the representation of cubic graphs that contain a Hamiltonian cycle. The cycle itself includes two out of the three adjacencies for each vertex, and the LCF notation specifies how far along the cycle each vertex's third neighbor is. A single graph may have multiple different representations in LCF notation.

Property Value
dbo:abstract
• In combinatorial mathematics, LCF notation or LCF code is a notation devised by Joshua Lederberg, and extended by H. S. M. Coxeter and Robert Frucht, for the representation of cubic graphs that contain a Hamiltonian cycle. The cycle itself includes two out of the three adjacencies for each vertex, and the LCF notation specifies how far along the cycle each vertex's third neighbor is. A single graph may have multiple different representations in LCF notation. (en)
dbo:thumbnail
dbo:wikiPageEditLink
dbo:wikiPageExternalLink
dbo:wikiPageExtracted
• 2019-06-05 05:18:41Z (xsd:date)
dbo:wikiPageHistoryLink
dbo:wikiPageID
• 24186720 (xsd:integer)
dbo:wikiPageLength
• 9884 (xsd:integer)
dbo:wikiPageModified
• 2019-06-05 04:49:40Z (xsd:date)
dbo:wikiPageOutDegree
• 47 (xsd:integer)
dbo:wikiPageRevisionID
• 900361740 (xsd:integer)
dbo:wikiPageRevisionLink
dbp:wikiPageUsesTemplate
dct:subject
rdf:type
rdfs:comment
• In combinatorial mathematics, LCF notation or LCF code is a notation devised by Joshua Lederberg, and extended by H. S. M. Coxeter and Robert Frucht, for the representation of cubic graphs that contain a Hamiltonian cycle. The cycle itself includes two out of the three adjacencies for each vertex, and the LCF notation specifies how far along the cycle each vertex's third neighbor is. A single graph may have multiple different representations in LCF notation. (en)
rdfs:label
• LCF notation (en)
owl:sameAs
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is foaf:primaryTopic of