ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Computing

Languages
English

Countries
Italy

Years
2004

Filter  
 
2  Articles
1 of 1 pages  |  10  records  |  more records»
A graph G is a (d, d + s)-graph if the degree of each vertex of G lies in the interval [d, d + s]. A (d, d + 1)-graph is said to be semiregular. An (r, r + 1) -factorization of a graph is a decomposition of the graph into edgedisjoint (r, r + 1)-factors.W... see more

A graph G is a (d, d + s)-graph if the degree of each vertex of G lies in the interval [d, d + s]. A (d, d + 1)-graph is said to be semiregular. An (r, r + 1) -factorization of a graph is a decomposition of the graph into edgedisjoint (r, r + 1)-factors.W... see more

1 of 1 pages  |  10  records  |  more records»