Information for "Edge cycle cover"

From HandWiki

Basic information

Display titleEdge cycle cover
Default sort keyEdge cycle cover
Page length (in bytes)2,095
Namespace ID0
Page ID234757
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
HandWiki item IDNone

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>Steve2012
Date of page creation22:11, 6 February 2024
Latest editorimported>Steve2012
Date of latest edit22:11, 6 February 2024
Total number of edits1
Recent number of edits (within past 90 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (12)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
In mathematics, an edge cycle cover (sometimes called simply cycle cover) of a graph is a family of cycles which are subgraphs of G and contain all edges of G. If the cycles of the cover have no vertices in common, the cover is called vertex-disjoint or sometimes simply disjoint cycle cover. In this...
Information from Extension:WikiSEO