A sufficient condition for a graph to be an (<i>a, b, k</i>)-critical graph (Q3056357): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On factors with given components / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Toughness and the existence of \(k\)-factors. IV / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A sufficient condition for a graph to have \([a,b]\)-factors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new degree condition for graphs to have \([a,b]\)-factor / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some sufficient conditions for graphs to have (<i>g, f</i>)-factors / rank | |||
Normal rank | |||
Latest revision as of 10:50, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for a graph to be an (<i>a, b, k</i>)-critical graph |
scientific article |
Statements
A sufficient condition for a graph to be an (<i>a, b, k</i>)-critical graph (English)
0 references
12 November 2010
0 references
graph
0 references
neighborhood
0 references
\([a, b]\)-factor
0 references
\((a, b, k)\)-critical graph
0 references
