Linear-time certifying algorithms for near-graphical sequences (Q1045061)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear-time certifying algorithms for near-graphical sequences |
scientific article; zbMATH DE number 5648108
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time certifying algorithms for near-graphical sequences |
scientific article; zbMATH DE number 5648108 |
Statements
Linear-time certifying algorithms for near-graphical sequences (English)
0 references
15 December 2009
0 references
degree sequence
0 references
graphical sequence
0 references
\(f\)-factor
0 references
(\(g,f)\)-factor
0 references
graph factor
0 references
certifying algorithm
0 references
