Criterion for a Type of (g,f)-3-Covered Graphs |
Received:May 17, 2004 |
Key Words:
graph factor covered graph $(g,f)$-3-covered graph.
|
Fund Project: |
|
Hits: 3200 |
Download times: 1332 |
Abstract: |
First, $(g,f)$-3-covered graph is defined. A graph $G$ is called a $(g,f)$-3-covered graph if every three edges belong to a $(g,f)$-factor. Then a necessary and sufficient condition for a bipartite graph $G=(X,Y)$ to be $(g,f)$-3-covered is given when $g\leq f$. Moreover, a necessary and sufficient condition for a bipartitle graph $G=(X,Y)$ to be $f$-3-covered is obtained. |
Citation: |
DOI:10.3770/j.issn:1000-341X.2006.03.030 |
View Full Text View/Add Comment |
|
|
|