On toughness and \((g,f)\)-factors in bipartite graphs (Q861483): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Factors and factorizations of graphs—a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tough graphs and Hamiltonian circuits. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4676513 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4808027 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02832055 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975401868 / rank | |||
Normal rank | |||
Latest revision as of 09:41, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On toughness and \((g,f)\)-factors in bipartite graphs |
scientific article |
Statements
On toughness and \((g,f)\)-factors in bipartite graphs (English)
0 references
29 January 2007
0 references
isolated toughness
0 references
