On \((g,f)\)-uniform graphs (Q2577646): 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.1007/s10255-005-0216-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029072371 / rank | |||
Normal rank | |||
Revision as of 19:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On \((g,f)\)-uniform graphs |
scientific article |
Statements
On \((g,f)\)-uniform graphs (English)
0 references
5 January 2006
0 references
A \((g,f)\)-factor of a graph \(G\) is a spanning subgraph \(F\) of \(G\) with \(g(x)\leq d_F(x)\leq f(x)\) for all \(x\in V(G)\). \(G\) is \((g,f)\)-uniform if for each edge of \(G\), there is a \((g,f)\)-factor containing it and another \((g,f)\)-factor excluding it. In this paper a necessary and sufficient condition for a graph to be a \((g,f)\)-uniform graph is given and some applications of this condition are discussed.
0 references
