A sufficient condition for a graph to be an (<i>a, b, k</i>)-critical graph (Q3056357): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207160902777914 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086829022 / rank | |||
Normal rank | |||
Revision as of 22:49, 19 March 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
