Semiregular factorization of simple graphs
<p>A graph <em>G</em> is a <em>(d, d + s)</em>-graph if the degree of each vertex of <em>G</em> lies in the interval<em> [d, d + s]</em>. A <em>(d, d + 1)</em>-graph is said to be semiregular. An <em>(r, r + 1)</em> -facto...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Università degli Studi di Catania
2004-11-01
|
| Series: | Le Matematiche |
| Online Access: | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/168 |