Sharp conditions for the existence of an even $[a,b]$-factor in a graph (Q4991404): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3203689818 / rank | |||
Normal rank | |||
| Property / title | |||
Sharp conditions for the existence of an even $[a,b]$-factor in a graph (English) | |||
| Property / title: Sharp conditions for the existence of an even $[a,b]$-factor in a graph (English) / rank | |||
Normal rank | |||
Latest revision as of 09:22, 30 July 2024
scientific article; zbMATH DE number 7353971
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sharp conditions for the existence of an even $[a,b]$-factor in a graph |
scientific article; zbMATH DE number 7353971 |
Statements
3 June 2021
0 references
even \([a
0 references
b]\)-factor
0 references
edge-connectivity
0 references
vertex-connectivity
0 references
spectral radius
0 references
math.CO
0 references
Sharp conditions for the existence of an even $[a,b]$-factor in a graph (English)
0 references
