A New Sufficient Condition for a Graph To Be (<i>g</i>, <i>f</i>, <i>n</i>)-Critical (Q3569399)
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: A New Sufficient Condition for a Graph To Be (g, f, n)-Critical |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A New Sufficient Condition for a Graph To Be (<i>g</i>, <i>f</i>, <i>n</i>)-Critical |
scientific article |
Statements
A New Sufficient Condition for a Graph To Be (<i>g</i>, <i>f</i>, <i>n</i>)-Critical (English)
0 references
21 June 2010
0 references
graph
0 references
\((g, f)\)-factor
0 references
\((g, f, n)\)-critical graph
0 references
binding number
0 references
0.95057553
0 references
0.9220325
0 references
0.91880643
0 references
